============================== FOF-Prover9 =========================== FOF-Prover9 (32) version 2009-02A, February 2009. Process 11235 was started by mccune on cleo, Wed Feb 25 09:32:26 2009 The command was "/home/mccune/bin/fof-prover9 -f ALG033+1.in". ============================== end of head =========================== ============================== INPUT ================================= % Reading from file ALG033+1.in assign(max_seconds,120). set(prolog_style_variables). formulas(assumptions). e0 != e1 & e0 != e2 & e0 != e3 & e0 != e4 & e0 != e5 & e1 != e2 & e1 != e3 & e1 != e4 & e1 != e5 & e2 != e3 & e2 != e4 & e2 != e5 & e3 != e4 & e3 != e5 & e4 != e5. op(e0,e0) = e0 & op(e0,e1) = e1 & op(e0,e2) = e2 & op(e0,e3) = e3 & op(e0,e4) = e4 & op(e0,e5) = e5 & op(e1,e0) = e1 & op(e1,e1) = e0 & op(e1,e2) = e3 & op(e1,e3) = e2 & op(e1,e4) = e5 & op(e1,e5) = e4 & op(e2,e0) = e2 & op(e2,e1) = e4 & op(e2,e2) = e0 & op(e2,e3) = e5 & op(e2,e4) = e1 & op(e2,e5) = e3 & op(e3,e0) = e3 & op(e3,e1) = e5 & op(e3,e2) = e1 & op(e3,e3) = e4 & op(e3,e4) = e0 & op(e3,e5) = e2 & op(e4,e0) = e4 & op(e4,e1) = e2 & op(e4,e2) = e5 & op(e4,e3) = e0 & op(e4,e4) = e3 & op(e4,e5) = e1 & op(e5,e0) = e5 & op(e5,e1) = e3 & op(e5,e2) = e4 & op(e5,e3) = e1 & op(e5,e4) = e2 & op(e5,e5) = e0. unit = e0. inv(e0) = e0 & inv(e1) = e1 & inv(e2) = e2 & inv(e3) = e4 & inv(e4) = e3 & inv(e5) = e5. -(-(op(e0,e0) = op(e0,e0) & op(e0,e1) = op(e1,e0) & op(e0,e2) = op(e2,e0) & op(e0,e3) = op(e3,e0) & op(e0,e4) = op(e4,e0) & op(e0,e5) = op(e5,e0) & op(e1,e0) = op(e0,e1) & op(e1,e1) = op(e1,e1) & op(e1,e2) = op(e2,e1) & op(e1,e3) = op(e3,e1) & op(e1,e4) = op(e4,e1) & op(e1,e5) = op(e5,e1) & op(e2,e0) = op(e0,e2) & op(e2,e1) = op(e1,e2) & op(e2,e2) = op(e2,e2) & op(e2,e3) = op(e3,e2) & op(e2,e4) = op(e4,e2) & op(e2,e5) = op(e5,e2) & op(e3,e0) = op(e0,e3) & op(e3,e1) = op(e1,e3) & op(e3,e2) = op(e2,e3) & op(e3,e3) = op(e3,e3) & op(e3,e4) = op(e4,e3) & op(e3,e5) = op(e5,e3) & op(e4,e0) = op(e0,e4) & op(e4,e1) = op(e1,e4) & op(e4,e2) = op(e2,e4) & op(e4,e3) = op(e3,e4) & op(e4,e4) = op(e4,e4) & op(e4,e5) = op(e5,e4) & op(e5,e0) = op(e0,e5) & op(e5,e1) = op(e1,e5) & op(e5,e2) = op(e2,e5) & op(e5,e3) = op(e3,e5) & op(e5,e4) = op(e4,e5) & op(e5,e5) = op(e5,e5)) & (op(e0,e0) = e0 | op(e0,e0) = e1 | op(e0,e0) = e2 | op(e0,e0) = e3 | op(e0,e0) = e4 | op(e0,e0) = e5) & (op(e0,e1) = e0 | op(e0,e1) = e1 | op(e0,e1) = e2 | op(e0,e1) = e3 | op(e0,e1) = e4 | op(e0,e1) = e5) & (op(e0,e2) = e0 | op(e0,e2) = e1 | op(e0,e2) = e2 | op(e0,e2) = e3 | op(e0,e2) = e4 | op(e0,e2) = e5) & (op(e0,e3) = e0 | op(e0,e3) = e1 | op(e0,e3) = e2 | op(e0,e3) = e3 | op(e0,e3) = e4 | op(e0,e3) = e5) & (op(e0,e4) = e0 | op(e0,e4) = e1 | op(e0,e4) = e2 | op(e0,e4) = e3 | op(e0,e4) = e4 | op(e0,e4) = e5) & (op(e0,e5) = e0 | op(e0,e5) = e1 | op(e0,e5) = e2 | op(e0,e5) = e3 | op(e0,e5) = e4 | op(e0,e5) = e5) & (op(e1,e0) = e0 | op(e1,e0) = e1 | op(e1,e0) = e2 | op(e1,e0) = e3 | op(e1,e0) = e4 | op(e1,e0) = e5) & (op(e1,e1) = e0 | op(e1,e1) = e1 | op(e1,e1) = e2 | op(e1,e1) = e3 | op(e1,e1) = e4 | op(e1,e1) = e5) & (op(e1,e2) = e0 | op(e1,e2) = e1 | op(e1,e2) = e2 | op(e1,e2) = e3 | op(e1,e2) = e4 | op(e1,e2) = e5) & (op(e1,e3) = e0 | op(e1,e3) = e1 | op(e1,e3) = e2 | op(e1,e3) = e3 | op(e1,e3) = e4 | op(e1,e3) = e5) & (op(e1,e4) = e0 | op(e1,e4) = e1 | op(e1,e4) = e2 | op(e1,e4) = e3 | op(e1,e4) = e4 | op(e1,e4) = e5) & (op(e1,e5) = e0 | op(e1,e5) = e1 | op(e1,e5) = e2 | op(e1,e5) = e3 | op(e1,e5) = e4 | op(e1,e5) = e5) & (op(e2,e0) = e0 | op(e2,e0) = e1 | op(e2,e0) = e2 | op(e2,e0) = e3 | op(e2,e0) = e4 | op(e2,e0) = e5) & (op(e2,e1) = e0 | op(e2,e1) = e1 | op(e2,e1) = e2 | op(e2,e1) = e3 | op(e2,e1) = e4 | op(e2,e1) = e5) & (op(e2,e2) = e0 | op(e2,e2) = e1 | op(e2,e2) = e2 | op(e2,e2) = e3 | op(e2,e2) = e4 | op(e2,e2) = e5) & (op(e2,e3) = e0 | op(e2,e3) = e1 | op(e2,e3) = e2 | op(e2,e3) = e3 | op(e2,e3) = e4 | op(e2,e3) = e5) & (op(e2,e4) = e0 | op(e2,e4) = e1 | op(e2,e4) = e2 | op(e2,e4) = e3 | op(e2,e4) = e4 | op(e2,e4) = e5) & (op(e2,e5) = e0 | op(e2,e5) = e1 | op(e2,e5) = e2 | op(e2,e5) = e3 | op(e2,e5) = e4 | op(e2,e5) = e5) & (op(e3,e0) = e0 | op(e3,e0) = e1 | op(e3,e0) = e2 | op(e3,e0) = e3 | op(e3,e0) = e4 | op(e3,e0) = e5) & (op(e3,e1) = e0 | op(e3,e1) = e1 | op(e3,e1) = e2 | op(e3,e1) = e3 | op(e3,e1) = e4 | op(e3,e1) = e5) & (op(e3,e2) = e0 | op(e3,e2) = e1 | op(e3,e2) = e2 | op(e3,e2) = e3 | op(e3,e2) = e4 | op(e3,e2) = e5) & (op(e3,e3) = e0 | op(e3,e3) = e1 | op(e3,e3) = e2 | op(e3,e3) = e3 | op(e3,e3) = e4 | op(e3,e3) = e5) & (op(e3,e4) = e0 | op(e3,e4) = e1 | op(e3,e4) = e2 | op(e3,e4) = e3 | op(e3,e4) = e4 | op(e3,e4) = e5) & (op(e3,e5) = e0 | op(e3,e5) = e1 | op(e3,e5) = e2 | op(e3,e5) = e3 | op(e3,e5) = e4 | op(e3,e5) = e5) & (op(e4,e0) = e0 | op(e4,e0) = e1 | op(e4,e0) = e2 | op(e4,e0) = e3 | op(e4,e0) = e4 | op(e4,e0) = e5) & (op(e4,e1) = e0 | op(e4,e1) = e1 | op(e4,e1) = e2 | op(e4,e1) = e3 | op(e4,e1) = e4 | op(e4,e1) = e5) & (op(e4,e2) = e0 | op(e4,e2) = e1 | op(e4,e2) = e2 | op(e4,e2) = e3 | op(e4,e2) = e4 | op(e4,e2) = e5) & (op(e4,e3) = e0 | op(e4,e3) = e1 | op(e4,e3) = e2 | op(e4,e3) = e3 | op(e4,e3) = e4 | op(e4,e3) = e5) & (op(e4,e4) = e0 | op(e4,e4) = e1 | op(e4,e4) = e2 | op(e4,e4) = e3 | op(e4,e4) = e4 | op(e4,e4) = e5) & (op(e4,e5) = e0 | op(e4,e5) = e1 | op(e4,e5) = e2 | op(e4,e5) = e3 | op(e4,e5) = e4 | op(e4,e5) = e5) & (op(e5,e0) = e0 | op(e5,e0) = e1 | op(e5,e0) = e2 | op(e5,e0) = e3 | op(e5,e0) = e4 | op(e5,e0) = e5) & (op(e5,e1) = e0 | op(e5,e1) = e1 | op(e5,e1) = e2 | op(e5,e1) = e3 | op(e5,e1) = e4 | op(e5,e1) = e5) & (op(e5,e2) = e0 | op(e5,e2) = e1 | op(e5,e2) = e2 | op(e5,e2) = e3 | op(e5,e2) = e4 | op(e5,e2) = e5) & (op(e5,e3) = e0 | op(e5,e3) = e1 | op(e5,e3) = e2 | op(e5,e3) = e3 | op(e5,e3) = e4 | op(e5,e3) = e5) & (op(e5,e4) = e0 | op(e5,e4) = e1 | op(e5,e4) = e2 | op(e5,e4) = e3 | op(e5,e4) = e4 | op(e5,e4) = e5) & (op(e5,e5) = e0 | op(e5,e5) = e1 | op(e5,e5) = e2 | op(e5,e5) = e3 | op(e5,e5) = e4 | op(e5,e5) = e5) & op(op(e0,e0),e0) = op(e0,op(e0,e0)) & op(op(e0,e0),e1) = op(e0,op(e0,e1)) & op(op(e0,e0),e2) = op(e0,op(e0,e2)) & op(op(e0,e0),e3) = op(e0,op(e0,e3)) & op(op(e0,e0),e4) = op(e0,op(e0,e4)) & op(op(e0,e0),e5) = op(e0,op(e0,e5)) & op(op(e0,e1),e0) = op(e0,op(e1,e0)) & op(op(e0,e1),e1) = op(e0,op(e1,e1)) & op(op(e0,e1),e2) = op(e0,op(e1,e2)) & op(op(e0,e1),e3) = op(e0,op(e1,e3)) & op(op(e0,e1),e4) = op(e0,op(e1,e4)) & op(op(e0,e1),e5) = op(e0,op(e1,e5)) & op(op(e0,e2),e0) = op(e0,op(e2,e0)) & op(op(e0,e2),e1) = op(e0,op(e2,e1)) & op(op(e0,e2),e2) = op(e0,op(e2,e2)) & op(op(e0,e2),e3) = op(e0,op(e2,e3)) & op(op(e0,e2),e4) = op(e0,op(e2,e4)) & op(op(e0,e2),e5) = op(e0,op(e2,e5)) & op(op(e0,e3),e0) = op(e0,op(e3,e0)) & op(op(e0,e3),e1) = op(e0,op(e3,e1)) & op(op(e0,e3),e2) = op(e0,op(e3,e2)) & op(op(e0,e3),e3) = op(e0,op(e3,e3)) & op(op(e0,e3),e4) = op(e0,op(e3,e4)) & op(op(e0,e3),e5) = op(e0,op(e3,e5)) & op(op(e0,e4),e0) = op(e0,op(e4,e0)) & op(op(e0,e4),e1) = op(e0,op(e4,e1)) & op(op(e0,e4),e2) = op(e0,op(e4,e2)) & op(op(e0,e4),e3) = op(e0,op(e4,e3)) & op(op(e0,e4),e4) = op(e0,op(e4,e4)) & op(op(e0,e4),e5) = op(e0,op(e4,e5)) & op(op(e0,e5),e0) = op(e0,op(e5,e0)) & op(op(e0,e5),e1) = op(e0,op(e5,e1)) & op(op(e0,e5),e2) = op(e0,op(e5,e2)) & op(op(e0,e5),e3) = op(e0,op(e5,e3)) & op(op(e0,e5),e4) = op(e0,op(e5,e4)) & op(op(e0,e5),e5) = op(e0,op(e5,e5)) & op(op(e1,e0),e0) = op(e1,op(e0,e0)) & op(op(e1,e0),e1) = op(e1,op(e0,e1)) & op(op(e1,e0),e2) = op(e1,op(e0,e2)) & op(op(e1,e0),e3) = op(e1,op(e0,e3)) & op(op(e1,e0),e4) = op(e1,op(e0,e4)) & op(op(e1,e0),e5) = op(e1,op(e0,e5)) & op(op(e1,e1),e0) = op(e1,op(e1,e0)) & op(op(e1,e1),e1) = op(e1,op(e1,e1)) & op(op(e1,e1),e2) = op(e1,op(e1,e2)) & op(op(e1,e1),e3) = op(e1,op(e1,e3)) & op(op(e1,e1),e4) = op(e1,op(e1,e4)) & op(op(e1,e1),e5) = op(e1,op(e1,e5)) & op(op(e1,e2),e0) = op(e1,op(e2,e0)) & op(op(e1,e2),e1) = op(e1,op(e2,e1)) & op(op(e1,e2),e2) = op(e1,op(e2,e2)) & op(op(e1,e2),e3) = op(e1,op(e2,e3)) & op(op(e1,e2),e4) = op(e1,op(e2,e4)) & op(op(e1,e2),e5) = op(e1,op(e2,e5)) & op(op(e1,e3),e0) = op(e1,op(e3,e0)) & op(op(e1,e3),e1) = op(e1,op(e3,e1)) & op(op(e1,e3),e2) = op(e1,op(e3,e2)) & op(op(e1,e3),e3) = op(e1,op(e3,e3)) & op(op(e1,e3),e4) = op(e1,op(e3,e4)) & op(op(e1,e3),e5) = op(e1,op(e3,e5)) & op(op(e1,e4),e0) = op(e1,op(e4,e0)) & op(op(e1,e4),e1) = op(e1,op(e4,e1)) & op(op(e1,e4),e2) = op(e1,op(e4,e2)) & op(op(e1,e4),e3) = op(e1,op(e4,e3)) & op(op(e1,e4),e4) = op(e1,op(e4,e4)) & op(op(e1,e4),e5) = op(e1,op(e4,e5)) & op(op(e1,e5),e0) = op(e1,op(e5,e0)) & op(op(e1,e5),e1) = op(e1,op(e5,e1)) & op(op(e1,e5),e2) = op(e1,op(e5,e2)) & op(op(e1,e5),e3) = op(e1,op(e5,e3)) & op(op(e1,e5),e4) = op(e1,op(e5,e4)) & op(op(e1,e5),e5) = op(e1,op(e5,e5)) & op(op(e2,e0),e0) = op(e2,op(e0,e0)) & op(op(e2,e0),e1) = op(e2,op(e0,e1)) & op(op(e2,e0),e2) = op(e2,op(e0,e2)) & op(op(e2,e0),e3) = op(e2,op(e0,e3)) & op(op(e2,e0),e4) = op(e2,op(e0,e4)) & op(op(e2,e0),e5) = op(e2,op(e0,e5)) & op(op(e2,e1),e0) = op(e2,op(e1,e0)) & op(op(e2,e1),e1) = op(e2,op(e1,e1)) & op(op(e2,e1),e2) = op(e2,op(e1,e2)) & op(op(e2,e1),e3) = op(e2,op(e1,e3)) & op(op(e2,e1),e4) = op(e2,op(e1,e4)) & op(op(e2,e1),e5) = op(e2,op(e1,e5)) & op(op(e2,e2),e0) = op(e2,op(e2,e0)) & op(op(e2,e2),e1) = op(e2,op(e2,e1)) & op(op(e2,e2),e2) = op(e2,op(e2,e2)) & op(op(e2,e2),e3) = op(e2,op(e2,e3)) & op(op(e2,e2),e4) = op(e2,op(e2,e4)) & op(op(e2,e2),e5) = op(e2,op(e2,e5)) & op(op(e2,e3),e0) = op(e2,op(e3,e0)) & op(op(e2,e3),e1) = op(e2,op(e3,e1)) & op(op(e2,e3),e2) = op(e2,op(e3,e2)) & op(op(e2,e3),e3) = op(e2,op(e3,e3)) & op(op(e2,e3),e4) = op(e2,op(e3,e4)) & op(op(e2,e3),e5) = op(e2,op(e3,e5)) & op(op(e2,e4),e0) = op(e2,op(e4,e0)) & op(op(e2,e4),e1) = op(e2,op(e4,e1)) & op(op(e2,e4),e2) = op(e2,op(e4,e2)) & op(op(e2,e4),e3) = op(e2,op(e4,e3)) & op(op(e2,e4),e4) = op(e2,op(e4,e4)) & op(op(e2,e4),e5) = op(e2,op(e4,e5)) & op(op(e2,e5),e0) = op(e2,op(e5,e0)) & op(op(e2,e5),e1) = op(e2,op(e5,e1)) & op(op(e2,e5),e2) = op(e2,op(e5,e2)) & op(op(e2,e5),e3) = op(e2,op(e5,e3)) & op(op(e2,e5),e4) = op(e2,op(e5,e4)) & op(op(e2,e5),e5) = op(e2,op(e5,e5)) & op(op(e3,e0),e0) = op(e3,op(e0,e0)) & op(op(e3,e0),e1) = op(e3,op(e0,e1)) & op(op(e3,e0),e2) = op(e3,op(e0,e2)) & op(op(e3,e0),e3) = op(e3,op(e0,e3)) & op(op(e3,e0),e4) = op(e3,op(e0,e4)) & op(op(e3,e0),e5) = op(e3,op(e0,e5)) & op(op(e3,e1),e0) = op(e3,op(e1,e0)) & op(op(e3,e1),e1) = op(e3,op(e1,e1)) & op(op(e3,e1),e2) = op(e3,op(e1,e2)) & op(op(e3,e1),e3) = op(e3,op(e1,e3)) & op(op(e3,e1),e4) = op(e3,op(e1,e4)) & op(op(e3,e1),e5) = op(e3,op(e1,e5)) & op(op(e3,e2),e0) = op(e3,op(e2,e0)) & op(op(e3,e2),e1) = op(e3,op(e2,e1)) & op(op(e3,e2),e2) = op(e3,op(e2,e2)) & op(op(e3,e2),e3) = op(e3,op(e2,e3)) & op(op(e3,e2),e4) = op(e3,op(e2,e4)) & op(op(e3,e2),e5) = op(e3,op(e2,e5)) & op(op(e3,e3),e0) = op(e3,op(e3,e0)) & op(op(e3,e3),e1) = op(e3,op(e3,e1)) & op(op(e3,e3),e2) = op(e3,op(e3,e2)) & op(op(e3,e3),e3) = op(e3,op(e3,e3)) & op(op(e3,e3),e4) = op(e3,op(e3,e4)) & op(op(e3,e3),e5) = op(e3,op(e3,e5)) & op(op(e3,e4),e0) = op(e3,op(e4,e0)) & op(op(e3,e4),e1) = op(e3,op(e4,e1)) & op(op(e3,e4),e2) = op(e3,op(e4,e2)) & op(op(e3,e4),e3) = op(e3,op(e4,e3)) & op(op(e3,e4),e4) = op(e3,op(e4,e4)) & op(op(e3,e4),e5) = op(e3,op(e4,e5)) & op(op(e3,e5),e0) = op(e3,op(e5,e0)) & op(op(e3,e5),e1) = op(e3,op(e5,e1)) & op(op(e3,e5),e2) = op(e3,op(e5,e2)) & op(op(e3,e5),e3) = op(e3,op(e5,e3)) & op(op(e3,e5),e4) = op(e3,op(e5,e4)) & op(op(e3,e5),e5) = op(e3,op(e5,e5)) & op(op(e4,e0),e0) = op(e4,op(e0,e0)) & op(op(e4,e0),e1) = op(e4,op(e0,e1)) & op(op(e4,e0),e2) = op(e4,op(e0,e2)) & op(op(e4,e0),e3) = op(e4,op(e0,e3)) & op(op(e4,e0),e4) = op(e4,op(e0,e4)) & op(op(e4,e0),e5) = op(e4,op(e0,e5)) & op(op(e4,e1),e0) = op(e4,op(e1,e0)) & op(op(e4,e1),e1) = op(e4,op(e1,e1)) & op(op(e4,e1),e2) = op(e4,op(e1,e2)) & op(op(e4,e1),e3) = op(e4,op(e1,e3)) & op(op(e4,e1),e4) = op(e4,op(e1,e4)) & op(op(e4,e1),e5) = op(e4,op(e1,e5)) & op(op(e4,e2),e0) = op(e4,op(e2,e0)) & op(op(e4,e2),e1) = op(e4,op(e2,e1)) & op(op(e4,e2),e2) = op(e4,op(e2,e2)) & op(op(e4,e2),e3) = op(e4,op(e2,e3)) & op(op(e4,e2),e4) = op(e4,op(e2,e4)) & op(op(e4,e2),e5) = op(e4,op(e2,e5)) & op(op(e4,e3),e0) = op(e4,op(e3,e0)) & op(op(e4,e3),e1) = op(e4,op(e3,e1)) & op(op(e4,e3),e2) = op(e4,op(e3,e2)) & op(op(e4,e3),e3) = op(e4,op(e3,e3)) & op(op(e4,e3),e4) = op(e4,op(e3,e4)) & op(op(e4,e3),e5) = op(e4,op(e3,e5)) & op(op(e4,e4),e0) = op(e4,op(e4,e0)) & op(op(e4,e4),e1) = op(e4,op(e4,e1)) & op(op(e4,e4),e2) = op(e4,op(e4,e2)) & op(op(e4,e4),e3) = op(e4,op(e4,e3)) & op(op(e4,e4),e4) = op(e4,op(e4,e4)) & op(op(e4,e4),e5) = op(e4,op(e4,e5)) & op(op(e4,e5),e0) = op(e4,op(e5,e0)) & op(op(e4,e5),e1) = op(e4,op(e5,e1)) & op(op(e4,e5),e2) = op(e4,op(e5,e2)) & op(op(e4,e5),e3) = op(e4,op(e5,e3)) & op(op(e4,e5),e4) = op(e4,op(e5,e4)) & op(op(e4,e5),e5) = op(e4,op(e5,e5)) & op(op(e5,e0),e0) = op(e5,op(e0,e0)) & op(op(e5,e0),e1) = op(e5,op(e0,e1)) & op(op(e5,e0),e2) = op(e5,op(e0,e2)) & op(op(e5,e0),e3) = op(e5,op(e0,e3)) & op(op(e5,e0),e4) = op(e5,op(e0,e4)) & op(op(e5,e0),e5) = op(e5,op(e0,e5)) & op(op(e5,e1),e0) = op(e5,op(e1,e0)) & op(op(e5,e1),e1) = op(e5,op(e1,e1)) & op(op(e5,e1),e2) = op(e5,op(e1,e2)) & op(op(e5,e1),e3) = op(e5,op(e1,e3)) & op(op(e5,e1),e4) = op(e5,op(e1,e4)) & op(op(e5,e1),e5) = op(e5,op(e1,e5)) & op(op(e5,e2),e0) = op(e5,op(e2,e0)) & op(op(e5,e2),e1) = op(e5,op(e2,e1)) & op(op(e5,e2),e2) = op(e5,op(e2,e2)) & op(op(e5,e2),e3) = op(e5,op(e2,e3)) & op(op(e5,e2),e4) = op(e5,op(e2,e4)) & op(op(e5,e2),e5) = op(e5,op(e2,e5)) & op(op(e5,e3),e0) = op(e5,op(e3,e0)) & op(op(e5,e3),e1) = op(e5,op(e3,e1)) & op(op(e5,e3),e2) = op(e5,op(e3,e2)) & op(op(e5,e3),e3) = op(e5,op(e3,e3)) & op(op(e5,e3),e4) = op(e5,op(e3,e4)) & op(op(e5,e3),e5) = op(e5,op(e3,e5)) & op(op(e5,e4),e0) = op(e5,op(e4,e0)) & op(op(e5,e4),e1) = op(e5,op(e4,e1)) & op(op(e5,e4),e2) = op(e5,op(e4,e2)) & op(op(e5,e4),e3) = op(e5,op(e4,e3)) & op(op(e5,e4),e4) = op(e5,op(e4,e4)) & op(op(e5,e4),e5) = op(e5,op(e4,e5)) & op(op(e5,e5),e0) = op(e5,op(e5,e0)) & op(op(e5,e5),e1) = op(e5,op(e5,e1)) & op(op(e5,e5),e2) = op(e5,op(e5,e2)) & op(op(e5,e5),e3) = op(e5,op(e5,e3)) & op(op(e5,e5),e4) = op(e5,op(e5,e4)) & op(op(e5,e5),e5) = op(e5,op(e5,e5)) & op(unit,e0) = e0 & op(e0,unit) = e0 & op(unit,e1) = e1 & op(e1,unit) = e1 & op(unit,e2) = e2 & op(e2,unit) = e2 & op(unit,e3) = e3 & op(e3,unit) = e3 & op(unit,e4) = e4 & op(e4,unit) = e4 & op(unit,e5) = e5 & op(e5,unit) = e5 & (unit = e0 | unit = e1 | unit = e2 | unit = e3 | unit = e4 | unit = e5) & op(e0,inv(e0)) = unit & op(inv(e0),e0) = unit & op(e1,inv(e1)) = unit & op(inv(e1),e1) = unit & op(e2,inv(e2)) = unit & op(inv(e2),e2) = unit & op(e3,inv(e3)) = unit & op(inv(e3),e3) = unit & op(e4,inv(e4)) = unit & op(inv(e4),e4) = unit & op(e5,inv(e5)) = unit & op(inv(e5),e5) = unit & (inv(e0) = e0 | inv(e0) = e1 | inv(e0) = e2 | inv(e0) = e3 | inv(e0) = e4 | inv(e0) = e5) & (inv(e1) = e0 | inv(e1) = e1 | inv(e1) = e2 | inv(e1) = e3 | inv(e1) = e4 | inv(e1) = e5) & (inv(e2) = e0 | inv(e2) = e1 | inv(e2) = e2 | inv(e2) = e3 | inv(e2) = e4 | inv(e2) = e5) & (inv(e3) = e0 | inv(e3) = e1 | inv(e3) = e2 | inv(e3) = e3 | inv(e3) = e4 | inv(e3) = e5) & (inv(e4) = e0 | inv(e4) = e1 | inv(e4) = e2 | inv(e4) = e3 | inv(e4) = e4 | inv(e4) = e5) & (inv(e5) = e0 | inv(e5) = e1 | inv(e5) = e2 | inv(e5) = e3 | inv(e5) = e4 | inv(e5) = e5)). end_of_list. ============================== end of input ========================== % clear(auto_denials), because it is incompatiable with FOF reduction. Attempting problem reduction; original problem has = <1156,58>. Problem reduction (1.68 sec) gives 241 independent subproblems: ( <95,79> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> <76,59> ). Max nnf_size of subproblems is 95; max cnf_max is 79. ============================== FOF REDUCTION MULTISEARCH ============= Subproblem 1 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & =(op(e0,e0),op(e0,e0)) & =(op(e1,e0),op(e0,e1)) & =(op(e2,e0),op(e0,e2)) & =(op(e3,e0),op(e0,e3)) & =(op(e4,e0),op(e0,e4)) & =(op(e5,e0),op(e0,e5)) & =(op(e1,e1),op(e1,e1)) & =(op(e2,e1),op(e1,e2)) & =(op(e3,e1),op(e1,e3)) & =(op(e4,e1),op(e1,e4)) & =(op(e5,e1),op(e1,e5)) & =(op(e2,e2),op(e2,e2)) & =(op(e3,e2),op(e2,e3)) & =(op(e4,e2),op(e2,e4)) & =(op(e5,e2),op(e2,e5)) & =(op(e3,e3),op(e3,e3)) & =(op(e4,e3),op(e3,e4)) & =(op(e5,e3),op(e3,e5)) & =(op(e4,e4),op(e4,e4)) & =(op(e5,e4),op(e4,e5)) & =(op(e5,e5),op(e5,e5))). Max_seconds is 119 for this subproblem. Child search process 11236 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(e0,e0) = op(e0,e0). [assumption]. op(e1,e0) = op(e0,e1). [assumption]. op(e2,e0) = op(e0,e2). [assumption]. op(e3,e0) = op(e0,e3). [assumption]. op(e4,e0) = op(e0,e4). [assumption]. op(e5,e0) = op(e0,e5). [assumption]. op(e1,e1) = op(e1,e1). [assumption]. op(e2,e1) = op(e1,e2). [assumption]. op(e3,e1) = op(e1,e3). [assumption]. op(e4,e1) = op(e1,e4). [assumption]. op(e5,e1) = op(e1,e5). [assumption]. op(e2,e2) = op(e2,e2). [assumption]. op(e3,e2) = op(e2,e3). [assumption]. op(e4,e2) = op(e2,e4). [assumption]. op(e5,e2) = op(e2,e5). [assumption]. op(e3,e3) = op(e3,e3). [assumption]. op(e4,e3) = op(e3,e4). [assumption]. op(e5,e3) = op(e3,e5). [assumption]. op(e4,e4) = op(e4,e4). [assumption]. op(e5,e4) = op(e4,e5). [assumption]. op(e5,e5) = op(e5,e5). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(e0,e0) = op(e0,e0). [assumption]. 60 op(e1,e0) = op(e0,e1). [assumption]. 61 op(e2,e0) = op(e0,e2). [assumption]. 62 op(e3,e0) = op(e0,e3). [assumption]. 63 op(e4,e0) = op(e0,e4). [assumption]. 64 op(e5,e0) = op(e0,e5). [assumption]. 65 op(e1,e1) = op(e1,e1). [assumption]. 66 op(e2,e1) = op(e1,e2). [assumption]. kept: 67 e4 = e3. [copy(66),rewrite([29(3),24(4)])]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 2. % Maximum clause weight is 5. % Given clauses 0. 13 e4 != e3. [assumption]. 24 op(e1,e2) = e3. [assumption]. 29 op(e2,e1) = e4. [assumption]. 66 op(e2,e1) = op(e1,e2). [assumption]. 67 e4 = e3. [copy(66),rewrite([29(3),24(4)])]. 68 $F. [resolve(67,a,13,a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=66. Kept=59. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=66. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=7. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=486. Demod_rewrites=16. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11236 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 2 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e0),e0),op(e0,op(e0,e0)))). Max_seconds is 119 for this subproblem. Child search process 11237 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e0),e0) != op(e0,op(e0,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e0),e0) != op(e0,op(e0,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 3. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 59 op(op(e0,e0),e0) != op(e0,op(e0,e0)). [assumption]. 60 $F. [copy(59),rewrite([16(3),16(3),16(5),16(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11237 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 3 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e0),e1),op(e0,op(e0,e1)))). Max_seconds is 119 for this subproblem. Child search process 11238 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e0),e1) != op(e0,op(e0,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e0),e1) != op(e0,op(e0,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 17 op(e0,e1) = e1. [assumption]. 59 op(op(e0,e0),e1) != op(e0,op(e0,e1)). [assumption]. 60 $F. [copy(59),rewrite([16(3),17(3),17(5),17(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11238 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 4 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e0),e2),op(e0,op(e0,e2)))). Max_seconds is 119 for this subproblem. Child search process 11239 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e0),e2) != op(e0,op(e0,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e0),e2) != op(e0,op(e0,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 18 op(e0,e2) = e2. [assumption]. 59 op(op(e0,e0),e2) != op(e0,op(e0,e2)). [assumption]. 60 $F. [copy(59),rewrite([16(3),18(3),18(5),18(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11239 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 5 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e0),e3),op(e0,op(e0,e3)))). Max_seconds is 119 for this subproblem. Child search process 11240 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e0),e3) != op(e0,op(e0,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e0),e3) != op(e0,op(e0,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 19 op(e0,e3) = e3. [assumption]. 59 op(op(e0,e0),e3) != op(e0,op(e0,e3)). [assumption]. 60 $F. [copy(59),rewrite([16(3),19(3),19(5),19(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11240 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 6 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e0),e4),op(e0,op(e0,e4)))). Max_seconds is 119 for this subproblem. Child search process 11241 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e0),e4) != op(e0,op(e0,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e0),e4) != op(e0,op(e0,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 20 op(e0,e4) = e4. [assumption]. 59 op(op(e0,e0),e4) != op(e0,op(e0,e4)). [assumption]. 60 $F. [copy(59),rewrite([16(3),20(3),20(5),20(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11241 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 7 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e0),e5),op(e0,op(e0,e5)))). Max_seconds is 119 for this subproblem. Child search process 11242 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e0),e5) != op(e0,op(e0,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e0),e5) != op(e0,op(e0,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 21 op(e0,e5) = e5. [assumption]. 59 op(op(e0,e0),e5) != op(e0,op(e0,e5)). [assumption]. 60 $F. [copy(59),rewrite([16(3),21(3),21(5),21(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11242 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 8 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e1),e0),op(e0,op(e1,e0)))). Max_seconds is 119 for this subproblem. Child search process 11243 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e1),e0) != op(e0,op(e1,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e1),e0) != op(e0,op(e1,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 22 op(e1,e0) = e1. [assumption]. 59 op(op(e0,e1),e0) != op(e0,op(e1,e0)). [assumption]. 60 $F. [copy(59),rewrite([17(3),22(3),22(5),17(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11243 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 9 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e1),e1),op(e0,op(e1,e1)))). Max_seconds is 119 for this subproblem. Child search process 11244 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e1),e1) != op(e0,op(e1,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e1),e1) != op(e0,op(e1,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 17 op(e0,e1) = e1. [assumption]. 23 op(e1,e1) = e0. [assumption]. 59 op(op(e0,e1),e1) != op(e0,op(e1,e1)). [assumption]. 60 $F. [copy(59),rewrite([17(3),23(3),23(5),16(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11244 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 10 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e1),e2),op(e0,op(e1,e2)))). Max_seconds is 119 for this subproblem. Child search process 11245 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e1),e2) != op(e0,op(e1,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e1),e2) != op(e0,op(e1,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 19 op(e0,e3) = e3. [assumption]. 24 op(e1,e2) = e3. [assumption]. 59 op(op(e0,e1),e2) != op(e0,op(e1,e2)). [assumption]. 60 $F. [copy(59),rewrite([17(3),24(3),24(5),19(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11245 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 11 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e1),e3),op(e0,op(e1,e3)))). Max_seconds is 119 for this subproblem. Child search process 11246 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e1),e3) != op(e0,op(e1,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e1),e3) != op(e0,op(e1,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 18 op(e0,e2) = e2. [assumption]. 25 op(e1,e3) = e2. [assumption]. 59 op(op(e0,e1),e3) != op(e0,op(e1,e3)). [assumption]. 60 $F. [copy(59),rewrite([17(3),25(3),25(5),18(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11246 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 12 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e1),e4),op(e0,op(e1,e4)))). Max_seconds is 119 for this subproblem. Child search process 11247 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e1),e4) != op(e0,op(e1,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e1),e4) != op(e0,op(e1,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 21 op(e0,e5) = e5. [assumption]. 26 op(e1,e4) = e5. [assumption]. 59 op(op(e0,e1),e4) != op(e0,op(e1,e4)). [assumption]. 60 $F. [copy(59),rewrite([17(3),26(3),26(5),21(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11247 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 13 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e1),e5),op(e0,op(e1,e5)))). Max_seconds is 119 for this subproblem. Child search process 11248 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e1),e5) != op(e0,op(e1,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e1),e5) != op(e0,op(e1,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 20 op(e0,e4) = e4. [assumption]. 27 op(e1,e5) = e4. [assumption]. 59 op(op(e0,e1),e5) != op(e0,op(e1,e5)). [assumption]. 60 $F. [copy(59),rewrite([17(3),27(3),27(5),20(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11248 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 14 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e2),e0),op(e0,op(e2,e0)))). Max_seconds is 119 for this subproblem. Child search process 11249 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e2),e0) != op(e0,op(e2,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e2),e0) != op(e0,op(e2,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 28 op(e2,e0) = e2. [assumption]. 59 op(op(e0,e2),e0) != op(e0,op(e2,e0)). [assumption]. 60 $F. [copy(59),rewrite([18(3),28(3),28(5),18(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11249 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 15 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e2),e1),op(e0,op(e2,e1)))). Max_seconds is 119 for this subproblem. Child search process 11250 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e2),e1) != op(e0,op(e2,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e2),e1) != op(e0,op(e2,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 20 op(e0,e4) = e4. [assumption]. 29 op(e2,e1) = e4. [assumption]. 59 op(op(e0,e2),e1) != op(e0,op(e2,e1)). [assumption]. 60 $F. [copy(59),rewrite([18(3),29(3),29(5),20(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11250 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 16 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e2),e2),op(e0,op(e2,e2)))). Max_seconds is 119 for this subproblem. Child search process 11251 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e2),e2) != op(e0,op(e2,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e2),e2) != op(e0,op(e2,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 18 op(e0,e2) = e2. [assumption]. 30 op(e2,e2) = e0. [assumption]. 59 op(op(e0,e2),e2) != op(e0,op(e2,e2)). [assumption]. 60 $F. [copy(59),rewrite([18(3),30(3),30(5),16(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11251 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 17 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e2),e3),op(e0,op(e2,e3)))). Max_seconds is 119 for this subproblem. Child search process 11252 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e2),e3) != op(e0,op(e2,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e2),e3) != op(e0,op(e2,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 21 op(e0,e5) = e5. [assumption]. 31 op(e2,e3) = e5. [assumption]. 59 op(op(e0,e2),e3) != op(e0,op(e2,e3)). [assumption]. 60 $F. [copy(59),rewrite([18(3),31(3),31(5),21(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11252 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 18 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e2),e4),op(e0,op(e2,e4)))). Max_seconds is 119 for this subproblem. Child search process 11253 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e2),e4) != op(e0,op(e2,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e2),e4) != op(e0,op(e2,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 18 op(e0,e2) = e2. [assumption]. 32 op(e2,e4) = e1. [assumption]. 59 op(op(e0,e2),e4) != op(e0,op(e2,e4)). [assumption]. 60 $F. [copy(59),rewrite([18(3),32(3),32(5),17(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11253 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 19 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e2),e5),op(e0,op(e2,e5)))). Max_seconds is 119 for this subproblem. Child search process 11254 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e2),e5) != op(e0,op(e2,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e2),e5) != op(e0,op(e2,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 19 op(e0,e3) = e3. [assumption]. 33 op(e2,e5) = e3. [assumption]. 59 op(op(e0,e2),e5) != op(e0,op(e2,e5)). [assumption]. 60 $F. [copy(59),rewrite([18(3),33(3),33(5),19(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11254 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 20 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e3),e0),op(e0,op(e3,e0)))). Max_seconds is 119 for this subproblem. Child search process 11255 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e3),e0) != op(e0,op(e3,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e3),e0) != op(e0,op(e3,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 19 op(e0,e3) = e3. [assumption]. 34 op(e3,e0) = e3. [assumption]. 59 op(op(e0,e3),e0) != op(e0,op(e3,e0)). [assumption]. 60 $F. [copy(59),rewrite([19(3),34(3),34(5),19(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11255 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 21 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e3),e1),op(e0,op(e3,e1)))). Max_seconds is 119 for this subproblem. Child search process 11256 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e3),e1) != op(e0,op(e3,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e3),e1) != op(e0,op(e3,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 19 op(e0,e3) = e3. [assumption]. 21 op(e0,e5) = e5. [assumption]. 35 op(e3,e1) = e5. [assumption]. 59 op(op(e0,e3),e1) != op(e0,op(e3,e1)). [assumption]. 60 $F. [copy(59),rewrite([19(3),35(3),35(5),21(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11256 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 22 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e3),e2),op(e0,op(e3,e2)))). Max_seconds is 119 for this subproblem. Child search process 11257 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e3),e2) != op(e0,op(e3,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e3),e2) != op(e0,op(e3,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 19 op(e0,e3) = e3. [assumption]. 36 op(e3,e2) = e1. [assumption]. 59 op(op(e0,e3),e2) != op(e0,op(e3,e2)). [assumption]. 60 $F. [copy(59),rewrite([19(3),36(3),36(5),17(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11257 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 23 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e3),e3),op(e0,op(e3,e3)))). Max_seconds is 119 for this subproblem. Child search process 11258 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e3),e3) != op(e0,op(e3,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e3),e3) != op(e0,op(e3,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 19 op(e0,e3) = e3. [assumption]. 20 op(e0,e4) = e4. [assumption]. 37 op(e3,e3) = e4. [assumption]. 59 op(op(e0,e3),e3) != op(e0,op(e3,e3)). [assumption]. 60 $F. [copy(59),rewrite([19(3),37(3),37(5),20(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11258 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 24 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e3),e4),op(e0,op(e3,e4)))). Max_seconds is 119 for this subproblem. Child search process 11259 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e3),e4) != op(e0,op(e3,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e3),e4) != op(e0,op(e3,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 19 op(e0,e3) = e3. [assumption]. 38 op(e3,e4) = e0. [assumption]. 59 op(op(e0,e3),e4) != op(e0,op(e3,e4)). [assumption]. 60 $F. [copy(59),rewrite([19(3),38(3),38(5),16(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11259 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 25 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e3),e5),op(e0,op(e3,e5)))). Max_seconds is 119 for this subproblem. Child search process 11260 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e3),e5) != op(e0,op(e3,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e3),e5) != op(e0,op(e3,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 19 op(e0,e3) = e3. [assumption]. 39 op(e3,e5) = e2. [assumption]. 59 op(op(e0,e3),e5) != op(e0,op(e3,e5)). [assumption]. 60 $F. [copy(59),rewrite([19(3),39(3),39(5),18(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11260 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 26 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e4),e0),op(e0,op(e4,e0)))). Max_seconds is 119 for this subproblem. Child search process 11261 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e4),e0) != op(e0,op(e4,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e4),e0) != op(e0,op(e4,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 20 op(e0,e4) = e4. [assumption]. 40 op(e4,e0) = e4. [assumption]. 59 op(op(e0,e4),e0) != op(e0,op(e4,e0)). [assumption]. 60 $F. [copy(59),rewrite([20(3),40(3),40(5),20(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11261 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 27 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e4),e1),op(e0,op(e4,e1)))). Max_seconds is 119 for this subproblem. Child search process 11262 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e4),e1) != op(e0,op(e4,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e4),e1) != op(e0,op(e4,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 20 op(e0,e4) = e4. [assumption]. 41 op(e4,e1) = e2. [assumption]. 59 op(op(e0,e4),e1) != op(e0,op(e4,e1)). [assumption]. 60 $F. [copy(59),rewrite([20(3),41(3),41(5),18(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11262 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 28 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e4),e2),op(e0,op(e4,e2)))). Max_seconds is 119 for this subproblem. Child search process 11263 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e4),e2) != op(e0,op(e4,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e4),e2) != op(e0,op(e4,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 20 op(e0,e4) = e4. [assumption]. 21 op(e0,e5) = e5. [assumption]. 42 op(e4,e2) = e5. [assumption]. 59 op(op(e0,e4),e2) != op(e0,op(e4,e2)). [assumption]. 60 $F. [copy(59),rewrite([20(3),42(3),42(5),21(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11263 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 29 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e4),e3),op(e0,op(e4,e3)))). Max_seconds is 119 for this subproblem. Child search process 11264 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e4),e3) != op(e0,op(e4,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e4),e3) != op(e0,op(e4,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 20 op(e0,e4) = e4. [assumption]. 43 op(e4,e3) = e0. [assumption]. 59 op(op(e0,e4),e3) != op(e0,op(e4,e3)). [assumption]. 60 $F. [copy(59),rewrite([20(3),43(3),43(5),16(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11264 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 30 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e4),e4),op(e0,op(e4,e4)))). Max_seconds is 119 for this subproblem. Child search process 11265 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e4),e4) != op(e0,op(e4,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e4),e4) != op(e0,op(e4,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 19 op(e0,e3) = e3. [assumption]. 20 op(e0,e4) = e4. [assumption]. 44 op(e4,e4) = e3. [assumption]. 59 op(op(e0,e4),e4) != op(e0,op(e4,e4)). [assumption]. 60 $F. [copy(59),rewrite([20(3),44(3),44(5),19(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11265 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 31 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e4),e5),op(e0,op(e4,e5)))). Max_seconds is 119 for this subproblem. Child search process 11266 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e4),e5) != op(e0,op(e4,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e4),e5) != op(e0,op(e4,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 20 op(e0,e4) = e4. [assumption]. 45 op(e4,e5) = e1. [assumption]. 59 op(op(e0,e4),e5) != op(e0,op(e4,e5)). [assumption]. 60 $F. [copy(59),rewrite([20(3),45(3),45(5),17(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11266 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 32 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e5),e0),op(e0,op(e5,e0)))). Max_seconds is 119 for this subproblem. Child search process 11267 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e5),e0) != op(e0,op(e5,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e5),e0) != op(e0,op(e5,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 21 op(e0,e5) = e5. [assumption]. 46 op(e5,e0) = e5. [assumption]. 59 op(op(e0,e5),e0) != op(e0,op(e5,e0)). [assumption]. 60 $F. [copy(59),rewrite([21(3),46(3),46(5),21(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11267 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 33 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e5),e1),op(e0,op(e5,e1)))). Max_seconds is 119 for this subproblem. Child search process 11268 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e5),e1) != op(e0,op(e5,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e5),e1) != op(e0,op(e5,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 19 op(e0,e3) = e3. [assumption]. 21 op(e0,e5) = e5. [assumption]. 47 op(e5,e1) = e3. [assumption]. 59 op(op(e0,e5),e1) != op(e0,op(e5,e1)). [assumption]. 60 $F. [copy(59),rewrite([21(3),47(3),47(5),19(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11268 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 34 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e5),e2),op(e0,op(e5,e2)))). Max_seconds is 119 for this subproblem. Child search process 11269 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e5),e2) != op(e0,op(e5,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e5),e2) != op(e0,op(e5,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 20 op(e0,e4) = e4. [assumption]. 21 op(e0,e5) = e5. [assumption]. 48 op(e5,e2) = e4. [assumption]. 59 op(op(e0,e5),e2) != op(e0,op(e5,e2)). [assumption]. 60 $F. [copy(59),rewrite([21(3),48(3),48(5),20(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11269 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 35 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e5),e3),op(e0,op(e5,e3)))). Max_seconds is 119 for this subproblem. Child search process 11270 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e5),e3) != op(e0,op(e5,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e5),e3) != op(e0,op(e5,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 21 op(e0,e5) = e5. [assumption]. 49 op(e5,e3) = e1. [assumption]. 59 op(op(e0,e5),e3) != op(e0,op(e5,e3)). [assumption]. 60 $F. [copy(59),rewrite([21(3),49(3),49(5),17(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11270 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 36 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e5),e4),op(e0,op(e5,e4)))). Max_seconds is 119 for this subproblem. Child search process 11271 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e5),e4) != op(e0,op(e5,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e5),e4) != op(e0,op(e5,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 21 op(e0,e5) = e5. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e0,e5),e4) != op(e0,op(e5,e4)). [assumption]. 60 $F. [copy(59),rewrite([21(3),50(3),50(5),18(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11271 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 37 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e0,e5),e5),op(e0,op(e5,e5)))). Max_seconds is 119 for this subproblem. Child search process 11272 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e0,e5),e5) != op(e0,op(e5,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e0,e5),e5) != op(e0,op(e5,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 21 op(e0,e5) = e5. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e0,e5),e5) != op(e0,op(e5,e5)). [assumption]. 60 $F. [copy(59),rewrite([21(3),51(3),51(5),16(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11272 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 38 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e0),e0),op(e1,op(e0,e0)))). Max_seconds is 119 for this subproblem. Child search process 11273 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e0),e0) != op(e1,op(e0,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e0),e0) != op(e1,op(e0,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 22 op(e1,e0) = e1. [assumption]. 59 op(op(e1,e0),e0) != op(e1,op(e0,e0)). [assumption]. 60 $F. [copy(59),rewrite([22(3),22(3),16(5),22(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11273 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 39 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e0),e1),op(e1,op(e0,e1)))). Max_seconds is 119 for this subproblem. Child search process 11274 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e0),e1) != op(e1,op(e0,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e0),e1) != op(e1,op(e0,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 22 op(e1,e0) = e1. [assumption]. 23 op(e1,e1) = e0. [assumption]. 59 op(op(e1,e0),e1) != op(e1,op(e0,e1)). [assumption]. 60 $F. [copy(59),rewrite([22(3),23(3),17(5),23(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11274 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 40 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e0),e2),op(e1,op(e0,e2)))). Max_seconds is 119 for this subproblem. Child search process 11275 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e0),e2) != op(e1,op(e0,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e0),e2) != op(e1,op(e0,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 22 op(e1,e0) = e1. [assumption]. 24 op(e1,e2) = e3. [assumption]. 59 op(op(e1,e0),e2) != op(e1,op(e0,e2)). [assumption]. 60 $F. [copy(59),rewrite([22(3),24(3),18(5),24(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11275 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 41 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e0),e3),op(e1,op(e0,e3)))). Max_seconds is 119 for this subproblem. Child search process 11276 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e0),e3) != op(e1,op(e0,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e0),e3) != op(e1,op(e0,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 19 op(e0,e3) = e3. [assumption]. 22 op(e1,e0) = e1. [assumption]. 25 op(e1,e3) = e2. [assumption]. 59 op(op(e1,e0),e3) != op(e1,op(e0,e3)). [assumption]. 60 $F. [copy(59),rewrite([22(3),25(3),19(5),25(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11276 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 42 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e0),e4),op(e1,op(e0,e4)))). Max_seconds is 119 for this subproblem. Child search process 11277 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e0),e4) != op(e1,op(e0,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e0),e4) != op(e1,op(e0,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 20 op(e0,e4) = e4. [assumption]. 22 op(e1,e0) = e1. [assumption]. 26 op(e1,e4) = e5. [assumption]. 59 op(op(e1,e0),e4) != op(e1,op(e0,e4)). [assumption]. 60 $F. [copy(59),rewrite([22(3),26(3),20(5),26(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11277 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 43 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e0),e5),op(e1,op(e0,e5)))). Max_seconds is 119 for this subproblem. Child search process 11278 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e0),e5) != op(e1,op(e0,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e0),e5) != op(e1,op(e0,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 21 op(e0,e5) = e5. [assumption]. 22 op(e1,e0) = e1. [assumption]. 27 op(e1,e5) = e4. [assumption]. 59 op(op(e1,e0),e5) != op(e1,op(e0,e5)). [assumption]. 60 $F. [copy(59),rewrite([22(3),27(3),21(5),27(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11278 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 44 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e1),e0),op(e1,op(e1,e0)))). Max_seconds is 119 for this subproblem. Child search process 11279 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e1),e0) != op(e1,op(e1,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e1),e0) != op(e1,op(e1,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 22 op(e1,e0) = e1. [assumption]. 23 op(e1,e1) = e0. [assumption]. 59 op(op(e1,e1),e0) != op(e1,op(e1,e0)). [assumption]. 60 $F. [copy(59),rewrite([23(3),16(3),22(5),23(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11279 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 45 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e1),e1),op(e1,op(e1,e1)))). Max_seconds is 119 for this subproblem. Child search process 11280 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e1),e1) != op(e1,op(e1,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e1),e1) != op(e1,op(e1,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 22 op(e1,e0) = e1. [assumption]. 23 op(e1,e1) = e0. [assumption]. 59 op(op(e1,e1),e1) != op(e1,op(e1,e1)). [assumption]. 60 $F. [copy(59),rewrite([23(3),17(3),23(5),22(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11280 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 46 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e1),e2),op(e1,op(e1,e2)))). Max_seconds is 119 for this subproblem. Child search process 11281 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e1),e2) != op(e1,op(e1,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e1),e2) != op(e1,op(e1,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 23 op(e1,e1) = e0. [assumption]. 24 op(e1,e2) = e3. [assumption]. 25 op(e1,e3) = e2. [assumption]. 59 op(op(e1,e1),e2) != op(e1,op(e1,e2)). [assumption]. 60 $F. [copy(59),rewrite([23(3),18(3),24(5),25(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11281 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 47 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e1),e3),op(e1,op(e1,e3)))). Max_seconds is 119 for this subproblem. Child search process 11282 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e1),e3) != op(e1,op(e1,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e1),e3) != op(e1,op(e1,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 19 op(e0,e3) = e3. [assumption]. 23 op(e1,e1) = e0. [assumption]. 24 op(e1,e2) = e3. [assumption]. 25 op(e1,e3) = e2. [assumption]. 59 op(op(e1,e1),e3) != op(e1,op(e1,e3)). [assumption]. 60 $F. [copy(59),rewrite([23(3),19(3),25(5),24(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11282 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 48 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e1),e4),op(e1,op(e1,e4)))). Max_seconds is 119 for this subproblem. Child search process 11283 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e1),e4) != op(e1,op(e1,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e1),e4) != op(e1,op(e1,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 20 op(e0,e4) = e4. [assumption]. 23 op(e1,e1) = e0. [assumption]. 26 op(e1,e4) = e5. [assumption]. 27 op(e1,e5) = e4. [assumption]. 59 op(op(e1,e1),e4) != op(e1,op(e1,e4)). [assumption]. 60 $F. [copy(59),rewrite([23(3),20(3),26(5),27(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11283 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 49 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e1),e5),op(e1,op(e1,e5)))). Max_seconds is 119 for this subproblem. Child search process 11284 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e1),e5) != op(e1,op(e1,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e1),e5) != op(e1,op(e1,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 21 op(e0,e5) = e5. [assumption]. 23 op(e1,e1) = e0. [assumption]. 26 op(e1,e4) = e5. [assumption]. 27 op(e1,e5) = e4. [assumption]. 59 op(op(e1,e1),e5) != op(e1,op(e1,e5)). [assumption]. 60 $F. [copy(59),rewrite([23(3),21(3),27(5),26(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11284 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 50 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e2),e0),op(e1,op(e2,e0)))). Max_seconds is 119 for this subproblem. Child search process 11285 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e2),e0) != op(e1,op(e2,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e2),e0) != op(e1,op(e2,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 24 op(e1,e2) = e3. [assumption]. 28 op(e2,e0) = e2. [assumption]. 34 op(e3,e0) = e3. [assumption]. 59 op(op(e1,e2),e0) != op(e1,op(e2,e0)). [assumption]. 60 $F. [copy(59),rewrite([24(3),34(3),28(5),24(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11285 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 51 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e2),e1),op(e1,op(e2,e1)))). Max_seconds is 119 for this subproblem. Child search process 11286 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e2),e1) != op(e1,op(e2,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e2),e1) != op(e1,op(e2,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 24 op(e1,e2) = e3. [assumption]. 26 op(e1,e4) = e5. [assumption]. 29 op(e2,e1) = e4. [assumption]. 35 op(e3,e1) = e5. [assumption]. 59 op(op(e1,e2),e1) != op(e1,op(e2,e1)). [assumption]. 60 $F. [copy(59),rewrite([24(3),35(3),29(5),26(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11286 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 52 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e2),e2),op(e1,op(e2,e2)))). Max_seconds is 119 for this subproblem. Child search process 11287 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e2),e2) != op(e1,op(e2,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e2),e2) != op(e1,op(e2,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 22 op(e1,e0) = e1. [assumption]. 24 op(e1,e2) = e3. [assumption]. 30 op(e2,e2) = e0. [assumption]. 36 op(e3,e2) = e1. [assumption]. 59 op(op(e1,e2),e2) != op(e1,op(e2,e2)). [assumption]. 60 $F. [copy(59),rewrite([24(3),36(3),30(5),22(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11287 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 53 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e2),e3),op(e1,op(e2,e3)))). Max_seconds is 119 for this subproblem. Child search process 11288 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e2),e3) != op(e1,op(e2,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e2),e3) != op(e1,op(e2,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 24 op(e1,e2) = e3. [assumption]. 27 op(e1,e5) = e4. [assumption]. 31 op(e2,e3) = e5. [assumption]. 37 op(e3,e3) = e4. [assumption]. 59 op(op(e1,e2),e3) != op(e1,op(e2,e3)). [assumption]. 60 $F. [copy(59),rewrite([24(3),37(3),31(5),27(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11288 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 54 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e2),e4),op(e1,op(e2,e4)))). Max_seconds is 119 for this subproblem. Child search process 11289 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e2),e4) != op(e1,op(e2,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e2),e4) != op(e1,op(e2,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 23 op(e1,e1) = e0. [assumption]. 24 op(e1,e2) = e3. [assumption]. 32 op(e2,e4) = e1. [assumption]. 38 op(e3,e4) = e0. [assumption]. 59 op(op(e1,e2),e4) != op(e1,op(e2,e4)). [assumption]. 60 $F. [copy(59),rewrite([24(3),38(3),32(5),23(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11289 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 55 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e2),e5),op(e1,op(e2,e5)))). Max_seconds is 119 for this subproblem. Child search process 11290 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e2),e5) != op(e1,op(e2,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e2),e5) != op(e1,op(e2,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 24 op(e1,e2) = e3. [assumption]. 25 op(e1,e3) = e2. [assumption]. 33 op(e2,e5) = e3. [assumption]. 39 op(e3,e5) = e2. [assumption]. 59 op(op(e1,e2),e5) != op(e1,op(e2,e5)). [assumption]. 60 $F. [copy(59),rewrite([24(3),39(3),33(5),25(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11290 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 56 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e3),e0),op(e1,op(e3,e0)))). Max_seconds is 119 for this subproblem. Child search process 11291 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e3),e0) != op(e1,op(e3,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e3),e0) != op(e1,op(e3,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 25 op(e1,e3) = e2. [assumption]. 28 op(e2,e0) = e2. [assumption]. 34 op(e3,e0) = e3. [assumption]. 59 op(op(e1,e3),e0) != op(e1,op(e3,e0)). [assumption]. 60 $F. [copy(59),rewrite([25(3),28(3),34(5),25(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11291 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 57 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e3),e1),op(e1,op(e3,e1)))). Max_seconds is 119 for this subproblem. Child search process 11292 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e3),e1) != op(e1,op(e3,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e3),e1) != op(e1,op(e3,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 25 op(e1,e3) = e2. [assumption]. 27 op(e1,e5) = e4. [assumption]. 29 op(e2,e1) = e4. [assumption]. 35 op(e3,e1) = e5. [assumption]. 59 op(op(e1,e3),e1) != op(e1,op(e3,e1)). [assumption]. 60 $F. [copy(59),rewrite([25(3),29(3),35(5),27(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11292 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 58 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e3),e2),op(e1,op(e3,e2)))). Max_seconds is 119 for this subproblem. Child search process 11293 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e3),e2) != op(e1,op(e3,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e3),e2) != op(e1,op(e3,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 23 op(e1,e1) = e0. [assumption]. 25 op(e1,e3) = e2. [assumption]. 30 op(e2,e2) = e0. [assumption]. 36 op(e3,e2) = e1. [assumption]. 59 op(op(e1,e3),e2) != op(e1,op(e3,e2)). [assumption]. 60 $F. [copy(59),rewrite([25(3),30(3),36(5),23(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11293 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 59 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e3),e3),op(e1,op(e3,e3)))). Max_seconds is 119 for this subproblem. Child search process 11294 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e3),e3) != op(e1,op(e3,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e3),e3) != op(e1,op(e3,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 25 op(e1,e3) = e2. [assumption]. 26 op(e1,e4) = e5. [assumption]. 31 op(e2,e3) = e5. [assumption]. 37 op(e3,e3) = e4. [assumption]. 59 op(op(e1,e3),e3) != op(e1,op(e3,e3)). [assumption]. 60 $F. [copy(59),rewrite([25(3),31(3),37(5),26(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11294 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 60 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e3),e4),op(e1,op(e3,e4)))). Max_seconds is 119 for this subproblem. Child search process 11295 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e3),e4) != op(e1,op(e3,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e3),e4) != op(e1,op(e3,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 22 op(e1,e0) = e1. [assumption]. 25 op(e1,e3) = e2. [assumption]. 32 op(e2,e4) = e1. [assumption]. 38 op(e3,e4) = e0. [assumption]. 59 op(op(e1,e3),e4) != op(e1,op(e3,e4)). [assumption]. 60 $F. [copy(59),rewrite([25(3),32(3),38(5),22(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11295 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 61 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e3),e5),op(e1,op(e3,e5)))). Max_seconds is 119 for this subproblem. Child search process 11296 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e3),e5) != op(e1,op(e3,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e3),e5) != op(e1,op(e3,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 24 op(e1,e2) = e3. [assumption]. 25 op(e1,e3) = e2. [assumption]. 33 op(e2,e5) = e3. [assumption]. 39 op(e3,e5) = e2. [assumption]. 59 op(op(e1,e3),e5) != op(e1,op(e3,e5)). [assumption]. 60 $F. [copy(59),rewrite([25(3),33(3),39(5),24(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11296 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 62 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e4),e0),op(e1,op(e4,e0)))). Max_seconds is 119 for this subproblem. Child search process 11297 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e4),e0) != op(e1,op(e4,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e4),e0) != op(e1,op(e4,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 26 op(e1,e4) = e5. [assumption]. 40 op(e4,e0) = e4. [assumption]. 46 op(e5,e0) = e5. [assumption]. 59 op(op(e1,e4),e0) != op(e1,op(e4,e0)). [assumption]. 60 $F. [copy(59),rewrite([26(3),46(3),40(5),26(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11297 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 63 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e4),e1),op(e1,op(e4,e1)))). Max_seconds is 119 for this subproblem. Child search process 11298 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e4),e1) != op(e1,op(e4,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e4),e1) != op(e1,op(e4,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 24 op(e1,e2) = e3. [assumption]. 26 op(e1,e4) = e5. [assumption]. 41 op(e4,e1) = e2. [assumption]. 47 op(e5,e1) = e3. [assumption]. 59 op(op(e1,e4),e1) != op(e1,op(e4,e1)). [assumption]. 60 $F. [copy(59),rewrite([26(3),47(3),41(5),24(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11298 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 64 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e4),e2),op(e1,op(e4,e2)))). Max_seconds is 119 for this subproblem. Child search process 11299 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e4),e2) != op(e1,op(e4,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e4),e2) != op(e1,op(e4,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 26 op(e1,e4) = e5. [assumption]. 27 op(e1,e5) = e4. [assumption]. 42 op(e4,e2) = e5. [assumption]. 48 op(e5,e2) = e4. [assumption]. 59 op(op(e1,e4),e2) != op(e1,op(e4,e2)). [assumption]. 60 $F. [copy(59),rewrite([26(3),48(3),42(5),27(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11299 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 65 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e4),e3),op(e1,op(e4,e3)))). Max_seconds is 119 for this subproblem. Child search process 11300 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e4),e3) != op(e1,op(e4,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e4),e3) != op(e1,op(e4,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 22 op(e1,e0) = e1. [assumption]. 26 op(e1,e4) = e5. [assumption]. 43 op(e4,e3) = e0. [assumption]. 49 op(e5,e3) = e1. [assumption]. 59 op(op(e1,e4),e3) != op(e1,op(e4,e3)). [assumption]. 60 $F. [copy(59),rewrite([26(3),49(3),43(5),22(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11300 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 66 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e4),e4),op(e1,op(e4,e4)))). Max_seconds is 119 for this subproblem. Child search process 11301 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e4),e4) != op(e1,op(e4,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e4),e4) != op(e1,op(e4,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 25 op(e1,e3) = e2. [assumption]. 26 op(e1,e4) = e5. [assumption]. 44 op(e4,e4) = e3. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e1,e4),e4) != op(e1,op(e4,e4)). [assumption]. 60 $F. [copy(59),rewrite([26(3),50(3),44(5),25(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11301 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 67 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e4),e5),op(e1,op(e4,e5)))). Max_seconds is 119 for this subproblem. Child search process 11302 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e4),e5) != op(e1,op(e4,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e4),e5) != op(e1,op(e4,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 23 op(e1,e1) = e0. [assumption]. 26 op(e1,e4) = e5. [assumption]. 45 op(e4,e5) = e1. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e1,e4),e5) != op(e1,op(e4,e5)). [assumption]. 60 $F. [copy(59),rewrite([26(3),51(3),45(5),23(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11302 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 68 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e5),e0),op(e1,op(e5,e0)))). Max_seconds is 119 for this subproblem. Child search process 11303 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e5),e0) != op(e1,op(e5,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e5),e0) != op(e1,op(e5,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 27 op(e1,e5) = e4. [assumption]. 40 op(e4,e0) = e4. [assumption]. 46 op(e5,e0) = e5. [assumption]. 59 op(op(e1,e5),e0) != op(e1,op(e5,e0)). [assumption]. 60 $F. [copy(59),rewrite([27(3),40(3),46(5),27(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11303 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 69 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e5),e1),op(e1,op(e5,e1)))). Max_seconds is 119 for this subproblem. Child search process 11304 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e5),e1) != op(e1,op(e5,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e5),e1) != op(e1,op(e5,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 25 op(e1,e3) = e2. [assumption]. 27 op(e1,e5) = e4. [assumption]. 41 op(e4,e1) = e2. [assumption]. 47 op(e5,e1) = e3. [assumption]. 59 op(op(e1,e5),e1) != op(e1,op(e5,e1)). [assumption]. 60 $F. [copy(59),rewrite([27(3),41(3),47(5),25(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11304 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 70 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e5),e2),op(e1,op(e5,e2)))). Max_seconds is 119 for this subproblem. Child search process 11305 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e5),e2) != op(e1,op(e5,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e5),e2) != op(e1,op(e5,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 26 op(e1,e4) = e5. [assumption]. 27 op(e1,e5) = e4. [assumption]. 42 op(e4,e2) = e5. [assumption]. 48 op(e5,e2) = e4. [assumption]. 59 op(op(e1,e5),e2) != op(e1,op(e5,e2)). [assumption]. 60 $F. [copy(59),rewrite([27(3),42(3),48(5),26(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11305 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 71 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e5),e3),op(e1,op(e5,e3)))). Max_seconds is 119 for this subproblem. Child search process 11306 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e5),e3) != op(e1,op(e5,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e5),e3) != op(e1,op(e5,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 23 op(e1,e1) = e0. [assumption]. 27 op(e1,e5) = e4. [assumption]. 43 op(e4,e3) = e0. [assumption]. 49 op(e5,e3) = e1. [assumption]. 59 op(op(e1,e5),e3) != op(e1,op(e5,e3)). [assumption]. 60 $F. [copy(59),rewrite([27(3),43(3),49(5),23(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11306 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 72 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e5),e4),op(e1,op(e5,e4)))). Max_seconds is 119 for this subproblem. Child search process 11307 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e5),e4) != op(e1,op(e5,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e5),e4) != op(e1,op(e5,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 24 op(e1,e2) = e3. [assumption]. 27 op(e1,e5) = e4. [assumption]. 44 op(e4,e4) = e3. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e1,e5),e4) != op(e1,op(e5,e4)). [assumption]. 60 $F. [copy(59),rewrite([27(3),44(3),50(5),24(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11307 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 73 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e1,e5),e5),op(e1,op(e5,e5)))). Max_seconds is 119 for this subproblem. Child search process 11308 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e1,e5),e5) != op(e1,op(e5,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e1,e5),e5) != op(e1,op(e5,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 22 op(e1,e0) = e1. [assumption]. 27 op(e1,e5) = e4. [assumption]. 45 op(e4,e5) = e1. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e1,e5),e5) != op(e1,op(e5,e5)). [assumption]. 60 $F. [copy(59),rewrite([27(3),45(3),51(5),22(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11308 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 74 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e0),e0),op(e2,op(e0,e0)))). Max_seconds is 119 for this subproblem. Child search process 11309 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e0),e0) != op(e2,op(e0,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e0),e0) != op(e2,op(e0,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 28 op(e2,e0) = e2. [assumption]. 59 op(op(e2,e0),e0) != op(e2,op(e0,e0)). [assumption]. 60 $F. [copy(59),rewrite([28(3),28(3),16(5),28(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11309 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 75 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e0),e1),op(e2,op(e0,e1)))). Max_seconds is 119 for this subproblem. Child search process 11310 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e0),e1) != op(e2,op(e0,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e0),e1) != op(e2,op(e0,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 28 op(e2,e0) = e2. [assumption]. 29 op(e2,e1) = e4. [assumption]. 59 op(op(e2,e0),e1) != op(e2,op(e0,e1)). [assumption]. 60 $F. [copy(59),rewrite([28(3),29(3),17(5),29(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11310 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 76 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e0),e2),op(e2,op(e0,e2)))). Max_seconds is 119 for this subproblem. Child search process 11311 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e0),e2) != op(e2,op(e0,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e0),e2) != op(e2,op(e0,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 28 op(e2,e0) = e2. [assumption]. 30 op(e2,e2) = e0. [assumption]. 59 op(op(e2,e0),e2) != op(e2,op(e0,e2)). [assumption]. 60 $F. [copy(59),rewrite([28(3),30(3),18(5),30(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11311 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 77 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e0),e3),op(e2,op(e0,e3)))). Max_seconds is 119 for this subproblem. Child search process 11312 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e0),e3) != op(e2,op(e0,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e0),e3) != op(e2,op(e0,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 19 op(e0,e3) = e3. [assumption]. 28 op(e2,e0) = e2. [assumption]. 31 op(e2,e3) = e5. [assumption]. 59 op(op(e2,e0),e3) != op(e2,op(e0,e3)). [assumption]. 60 $F. [copy(59),rewrite([28(3),31(3),19(5),31(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11312 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 78 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e0),e4),op(e2,op(e0,e4)))). Max_seconds is 119 for this subproblem. Child search process 11313 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e0),e4) != op(e2,op(e0,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e0),e4) != op(e2,op(e0,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 20 op(e0,e4) = e4. [assumption]. 28 op(e2,e0) = e2. [assumption]. 32 op(e2,e4) = e1. [assumption]. 59 op(op(e2,e0),e4) != op(e2,op(e0,e4)). [assumption]. 60 $F. [copy(59),rewrite([28(3),32(3),20(5),32(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11313 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 79 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e0),e5),op(e2,op(e0,e5)))). Max_seconds is 119 for this subproblem. Child search process 11314 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e0),e5) != op(e2,op(e0,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e0),e5) != op(e2,op(e0,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 21 op(e0,e5) = e5. [assumption]. 28 op(e2,e0) = e2. [assumption]. 33 op(e2,e5) = e3. [assumption]. 59 op(op(e2,e0),e5) != op(e2,op(e0,e5)). [assumption]. 60 $F. [copy(59),rewrite([28(3),33(3),21(5),33(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11314 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 80 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e1),e0),op(e2,op(e1,e0)))). Max_seconds is 119 for this subproblem. Child search process 11315 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e1),e0) != op(e2,op(e1,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e1),e0) != op(e2,op(e1,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 22 op(e1,e0) = e1. [assumption]. 29 op(e2,e1) = e4. [assumption]. 40 op(e4,e0) = e4. [assumption]. 59 op(op(e2,e1),e0) != op(e2,op(e1,e0)). [assumption]. 60 $F. [copy(59),rewrite([29(3),40(3),22(5),29(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11315 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 81 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e1),e1),op(e2,op(e1,e1)))). Max_seconds is 119 for this subproblem. Child search process 11316 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e1),e1) != op(e2,op(e1,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e1),e1) != op(e2,op(e1,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 23 op(e1,e1) = e0. [assumption]. 28 op(e2,e0) = e2. [assumption]. 29 op(e2,e1) = e4. [assumption]. 41 op(e4,e1) = e2. [assumption]. 59 op(op(e2,e1),e1) != op(e2,op(e1,e1)). [assumption]. 60 $F. [copy(59),rewrite([29(3),41(3),23(5),28(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11316 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 82 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e1),e2),op(e2,op(e1,e2)))). Max_seconds is 119 for this subproblem. Child search process 11317 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e1),e2) != op(e2,op(e1,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e1),e2) != op(e2,op(e1,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 24 op(e1,e2) = e3. [assumption]. 29 op(e2,e1) = e4. [assumption]. 31 op(e2,e3) = e5. [assumption]. 42 op(e4,e2) = e5. [assumption]. 59 op(op(e2,e1),e2) != op(e2,op(e1,e2)). [assumption]. 60 $F. [copy(59),rewrite([29(3),42(3),24(5),31(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11317 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 83 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e1),e3),op(e2,op(e1,e3)))). Max_seconds is 119 for this subproblem. Child search process 11318 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e1),e3) != op(e2,op(e1,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e1),e3) != op(e2,op(e1,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 25 op(e1,e3) = e2. [assumption]. 29 op(e2,e1) = e4. [assumption]. 30 op(e2,e2) = e0. [assumption]. 43 op(e4,e3) = e0. [assumption]. 59 op(op(e2,e1),e3) != op(e2,op(e1,e3)). [assumption]. 60 $F. [copy(59),rewrite([29(3),43(3),25(5),30(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11318 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 84 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e1),e4),op(e2,op(e1,e4)))). Max_seconds is 119 for this subproblem. Child search process 11319 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e1),e4) != op(e2,op(e1,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e1),e4) != op(e2,op(e1,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 26 op(e1,e4) = e5. [assumption]. 29 op(e2,e1) = e4. [assumption]. 33 op(e2,e5) = e3. [assumption]. 44 op(e4,e4) = e3. [assumption]. 59 op(op(e2,e1),e4) != op(e2,op(e1,e4)). [assumption]. 60 $F. [copy(59),rewrite([29(3),44(3),26(5),33(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11319 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 85 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e1),e5),op(e2,op(e1,e5)))). Max_seconds is 119 for this subproblem. Child search process 11320 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e1),e5) != op(e2,op(e1,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e1),e5) != op(e2,op(e1,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 27 op(e1,e5) = e4. [assumption]. 29 op(e2,e1) = e4. [assumption]. 32 op(e2,e4) = e1. [assumption]. 45 op(e4,e5) = e1. [assumption]. 59 op(op(e2,e1),e5) != op(e2,op(e1,e5)). [assumption]. 60 $F. [copy(59),rewrite([29(3),45(3),27(5),32(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11320 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 86 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e2),e0),op(e2,op(e2,e0)))). Max_seconds is 119 for this subproblem. Child search process 11321 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e2),e0) != op(e2,op(e2,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e2),e0) != op(e2,op(e2,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 28 op(e2,e0) = e2. [assumption]. 30 op(e2,e2) = e0. [assumption]. 59 op(op(e2,e2),e0) != op(e2,op(e2,e0)). [assumption]. 60 $F. [copy(59),rewrite([30(3),16(3),28(5),30(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11321 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 87 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e2),e1),op(e2,op(e2,e1)))). Max_seconds is 119 for this subproblem. Child search process 11322 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e2),e1) != op(e2,op(e2,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e2),e1) != op(e2,op(e2,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 29 op(e2,e1) = e4. [assumption]. 30 op(e2,e2) = e0. [assumption]. 32 op(e2,e4) = e1. [assumption]. 59 op(op(e2,e2),e1) != op(e2,op(e2,e1)). [assumption]. 60 $F. [copy(59),rewrite([30(3),17(3),29(5),32(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11322 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 88 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e2),e2),op(e2,op(e2,e2)))). Max_seconds is 119 for this subproblem. Child search process 11323 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e2),e2) != op(e2,op(e2,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e2),e2) != op(e2,op(e2,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 28 op(e2,e0) = e2. [assumption]. 30 op(e2,e2) = e0. [assumption]. 59 op(op(e2,e2),e2) != op(e2,op(e2,e2)). [assumption]. 60 $F. [copy(59),rewrite([30(3),18(3),30(5),28(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11323 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 89 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e2),e3),op(e2,op(e2,e3)))). Max_seconds is 119 for this subproblem. Child search process 11324 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e2),e3) != op(e2,op(e2,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e2),e3) != op(e2,op(e2,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 19 op(e0,e3) = e3. [assumption]. 30 op(e2,e2) = e0. [assumption]. 31 op(e2,e3) = e5. [assumption]. 33 op(e2,e5) = e3. [assumption]. 59 op(op(e2,e2),e3) != op(e2,op(e2,e3)). [assumption]. 60 $F. [copy(59),rewrite([30(3),19(3),31(5),33(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11324 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 90 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e2),e4),op(e2,op(e2,e4)))). Max_seconds is 119 for this subproblem. Child search process 11325 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e2),e4) != op(e2,op(e2,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e2),e4) != op(e2,op(e2,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 20 op(e0,e4) = e4. [assumption]. 29 op(e2,e1) = e4. [assumption]. 30 op(e2,e2) = e0. [assumption]. 32 op(e2,e4) = e1. [assumption]. 59 op(op(e2,e2),e4) != op(e2,op(e2,e4)). [assumption]. 60 $F. [copy(59),rewrite([30(3),20(3),32(5),29(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11325 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 91 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e2),e5),op(e2,op(e2,e5)))). Max_seconds is 119 for this subproblem. Child search process 11326 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e2),e5) != op(e2,op(e2,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e2),e5) != op(e2,op(e2,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 21 op(e0,e5) = e5. [assumption]. 30 op(e2,e2) = e0. [assumption]. 31 op(e2,e3) = e5. [assumption]. 33 op(e2,e5) = e3. [assumption]. 59 op(op(e2,e2),e5) != op(e2,op(e2,e5)). [assumption]. 60 $F. [copy(59),rewrite([30(3),21(3),33(5),31(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11326 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 92 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e3),e0),op(e2,op(e3,e0)))). Max_seconds is 119 for this subproblem. Child search process 11327 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e3),e0) != op(e2,op(e3,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e3),e0) != op(e2,op(e3,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 31 op(e2,e3) = e5. [assumption]. 34 op(e3,e0) = e3. [assumption]. 46 op(e5,e0) = e5. [assumption]. 59 op(op(e2,e3),e0) != op(e2,op(e3,e0)). [assumption]. 60 $F. [copy(59),rewrite([31(3),46(3),34(5),31(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11327 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 93 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e3),e1),op(e2,op(e3,e1)))). Max_seconds is 119 for this subproblem. Child search process 11328 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e3),e1) != op(e2,op(e3,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e3),e1) != op(e2,op(e3,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 31 op(e2,e3) = e5. [assumption]. 33 op(e2,e5) = e3. [assumption]. 35 op(e3,e1) = e5. [assumption]. 47 op(e5,e1) = e3. [assumption]. 59 op(op(e2,e3),e1) != op(e2,op(e3,e1)). [assumption]. 60 $F. [copy(59),rewrite([31(3),47(3),35(5),33(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=2. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11328 exit (max_proofs) Wed Feb 25 09:32:28 2009 ============================== continuing FOF reduction multisearch == Subproblem 94 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e3),e2),op(e2,op(e3,e2)))). Max_seconds is 119 for this subproblem. Child search process 11329 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e3),e2) != op(e2,op(e3,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e3),e2) != op(e2,op(e3,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 29 op(e2,e1) = e4. [assumption]. 31 op(e2,e3) = e5. [assumption]. 36 op(e3,e2) = e1. [assumption]. 48 op(e5,e2) = e4. [assumption]. 59 op(op(e2,e3),e2) != op(e2,op(e3,e2)). [assumption]. 60 $F. [copy(59),rewrite([31(3),48(3),36(5),29(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11329 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 95 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e3),e3),op(e2,op(e3,e3)))). Max_seconds is 119 for this subproblem. Child search process 11330 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e3),e3) != op(e2,op(e3,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e3),e3) != op(e2,op(e3,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 31 op(e2,e3) = e5. [assumption]. 32 op(e2,e4) = e1. [assumption]. 37 op(e3,e3) = e4. [assumption]. 49 op(e5,e3) = e1. [assumption]. 59 op(op(e2,e3),e3) != op(e2,op(e3,e3)). [assumption]. 60 $F. [copy(59),rewrite([31(3),49(3),37(5),32(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11330 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 96 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e3),e4),op(e2,op(e3,e4)))). Max_seconds is 119 for this subproblem. Child search process 11331 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e3),e4) != op(e2,op(e3,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e3),e4) != op(e2,op(e3,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 28 op(e2,e0) = e2. [assumption]. 31 op(e2,e3) = e5. [assumption]. 38 op(e3,e4) = e0. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e2,e3),e4) != op(e2,op(e3,e4)). [assumption]. 60 $F. [copy(59),rewrite([31(3),50(3),38(5),28(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11331 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 97 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e3),e5),op(e2,op(e3,e5)))). Max_seconds is 119 for this subproblem. Child search process 11332 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e3),e5) != op(e2,op(e3,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e3),e5) != op(e2,op(e3,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 30 op(e2,e2) = e0. [assumption]. 31 op(e2,e3) = e5. [assumption]. 39 op(e3,e5) = e2. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e2,e3),e5) != op(e2,op(e3,e5)). [assumption]. 60 $F. [copy(59),rewrite([31(3),51(3),39(5),30(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11332 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 98 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e4),e0),op(e2,op(e4,e0)))). Max_seconds is 119 for this subproblem. Child search process 11333 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e4),e0) != op(e2,op(e4,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e4),e0) != op(e2,op(e4,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 22 op(e1,e0) = e1. [assumption]. 32 op(e2,e4) = e1. [assumption]. 40 op(e4,e0) = e4. [assumption]. 59 op(op(e2,e4),e0) != op(e2,op(e4,e0)). [assumption]. 60 $F. [copy(59),rewrite([32(3),22(3),40(5),32(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11333 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 99 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e4),e1),op(e2,op(e4,e1)))). Max_seconds is 119 for this subproblem. Child search process 11334 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e4),e1) != op(e2,op(e4,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e4),e1) != op(e2,op(e4,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 23 op(e1,e1) = e0. [assumption]. 30 op(e2,e2) = e0. [assumption]. 32 op(e2,e4) = e1. [assumption]. 41 op(e4,e1) = e2. [assumption]. 59 op(op(e2,e4),e1) != op(e2,op(e4,e1)). [assumption]. 60 $F. [copy(59),rewrite([32(3),23(3),41(5),30(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11334 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 100 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e4),e2),op(e2,op(e4,e2)))). Max_seconds is 119 for this subproblem. Child search process 11335 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e4),e2) != op(e2,op(e4,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e4),e2) != op(e2,op(e4,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 24 op(e1,e2) = e3. [assumption]. 32 op(e2,e4) = e1. [assumption]. 33 op(e2,e5) = e3. [assumption]. 42 op(e4,e2) = e5. [assumption]. 59 op(op(e2,e4),e2) != op(e2,op(e4,e2)). [assumption]. 60 $F. [copy(59),rewrite([32(3),24(3),42(5),33(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11335 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 101 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e4),e3),op(e2,op(e4,e3)))). Max_seconds is 119 for this subproblem. Child search process 11336 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e4),e3) != op(e2,op(e4,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e4),e3) != op(e2,op(e4,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 25 op(e1,e3) = e2. [assumption]. 28 op(e2,e0) = e2. [assumption]. 32 op(e2,e4) = e1. [assumption]. 43 op(e4,e3) = e0. [assumption]. 59 op(op(e2,e4),e3) != op(e2,op(e4,e3)). [assumption]. 60 $F. [copy(59),rewrite([32(3),25(3),43(5),28(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11336 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 102 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e4),e4),op(e2,op(e4,e4)))). Max_seconds is 119 for this subproblem. Child search process 11337 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e4),e4) != op(e2,op(e4,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e4),e4) != op(e2,op(e4,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 26 op(e1,e4) = e5. [assumption]. 31 op(e2,e3) = e5. [assumption]. 32 op(e2,e4) = e1. [assumption]. 44 op(e4,e4) = e3. [assumption]. 59 op(op(e2,e4),e4) != op(e2,op(e4,e4)). [assumption]. 60 $F. [copy(59),rewrite([32(3),26(3),44(5),31(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11337 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 103 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e4),e5),op(e2,op(e4,e5)))). Max_seconds is 119 for this subproblem. Child search process 11338 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e4),e5) != op(e2,op(e4,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e4),e5) != op(e2,op(e4,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 27 op(e1,e5) = e4. [assumption]. 29 op(e2,e1) = e4. [assumption]. 32 op(e2,e4) = e1. [assumption]. 45 op(e4,e5) = e1. [assumption]. 59 op(op(e2,e4),e5) != op(e2,op(e4,e5)). [assumption]. 60 $F. [copy(59),rewrite([32(3),27(3),45(5),29(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11338 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 104 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e5),e0),op(e2,op(e5,e0)))). Max_seconds is 119 for this subproblem. Child search process 11339 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e5),e0) != op(e2,op(e5,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e5),e0) != op(e2,op(e5,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 33 op(e2,e5) = e3. [assumption]. 34 op(e3,e0) = e3. [assumption]. 46 op(e5,e0) = e5. [assumption]. 59 op(op(e2,e5),e0) != op(e2,op(e5,e0)). [assumption]. 60 $F. [copy(59),rewrite([33(3),34(3),46(5),33(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11339 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 105 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e5),e1),op(e2,op(e5,e1)))). Max_seconds is 119 for this subproblem. Child search process 11340 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e5),e1) != op(e2,op(e5,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e5),e1) != op(e2,op(e5,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 31 op(e2,e3) = e5. [assumption]. 33 op(e2,e5) = e3. [assumption]. 35 op(e3,e1) = e5. [assumption]. 47 op(e5,e1) = e3. [assumption]. 59 op(op(e2,e5),e1) != op(e2,op(e5,e1)). [assumption]. 60 $F. [copy(59),rewrite([33(3),35(3),47(5),31(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11340 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 106 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e5),e2),op(e2,op(e5,e2)))). Max_seconds is 119 for this subproblem. Child search process 11341 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e5),e2) != op(e2,op(e5,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e5),e2) != op(e2,op(e5,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 32 op(e2,e4) = e1. [assumption]. 33 op(e2,e5) = e3. [assumption]. 36 op(e3,e2) = e1. [assumption]. 48 op(e5,e2) = e4. [assumption]. 59 op(op(e2,e5),e2) != op(e2,op(e5,e2)). [assumption]. 60 $F. [copy(59),rewrite([33(3),36(3),48(5),32(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11341 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 107 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e5),e3),op(e2,op(e5,e3)))). Max_seconds is 119 for this subproblem. Child search process 11342 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e5),e3) != op(e2,op(e5,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e5),e3) != op(e2,op(e5,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 29 op(e2,e1) = e4. [assumption]. 33 op(e2,e5) = e3. [assumption]. 37 op(e3,e3) = e4. [assumption]. 49 op(e5,e3) = e1. [assumption]. 59 op(op(e2,e5),e3) != op(e2,op(e5,e3)). [assumption]. 60 $F. [copy(59),rewrite([33(3),37(3),49(5),29(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11342 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 108 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e5),e4),op(e2,op(e5,e4)))). Max_seconds is 119 for this subproblem. Child search process 11343 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e5),e4) != op(e2,op(e5,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e5),e4) != op(e2,op(e5,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 30 op(e2,e2) = e0. [assumption]. 33 op(e2,e5) = e3. [assumption]. 38 op(e3,e4) = e0. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e2,e5),e4) != op(e2,op(e5,e4)). [assumption]. 60 $F. [copy(59),rewrite([33(3),38(3),50(5),30(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11343 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 109 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e2,e5),e5),op(e2,op(e5,e5)))). Max_seconds is 119 for this subproblem. Child search process 11344 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e2,e5),e5) != op(e2,op(e5,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e2,e5),e5) != op(e2,op(e5,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 28 op(e2,e0) = e2. [assumption]. 33 op(e2,e5) = e3. [assumption]. 39 op(e3,e5) = e2. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e2,e5),e5) != op(e2,op(e5,e5)). [assumption]. 60 $F. [copy(59),rewrite([33(3),39(3),51(5),28(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11344 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 110 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e0),e0),op(e3,op(e0,e0)))). Max_seconds is 119 for this subproblem. Child search process 11345 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e0),e0) != op(e3,op(e0,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e0),e0) != op(e3,op(e0,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 34 op(e3,e0) = e3. [assumption]. 59 op(op(e3,e0),e0) != op(e3,op(e0,e0)). [assumption]. 60 $F. [copy(59),rewrite([34(3),34(3),16(5),34(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11345 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 111 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e0),e1),op(e3,op(e0,e1)))). Max_seconds is 119 for this subproblem. Child search process 11346 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e0),e1) != op(e3,op(e0,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e0),e1) != op(e3,op(e0,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 34 op(e3,e0) = e3. [assumption]. 35 op(e3,e1) = e5. [assumption]. 59 op(op(e3,e0),e1) != op(e3,op(e0,e1)). [assumption]. 60 $F. [copy(59),rewrite([34(3),35(3),17(5),35(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11346 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 112 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e0),e2),op(e3,op(e0,e2)))). Max_seconds is 119 for this subproblem. Child search process 11347 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e0),e2) != op(e3,op(e0,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e0),e2) != op(e3,op(e0,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 34 op(e3,e0) = e3. [assumption]. 36 op(e3,e2) = e1. [assumption]. 59 op(op(e3,e0),e2) != op(e3,op(e0,e2)). [assumption]. 60 $F. [copy(59),rewrite([34(3),36(3),18(5),36(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11347 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 113 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e0),e3),op(e3,op(e0,e3)))). Max_seconds is 119 for this subproblem. Child search process 11348 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e0),e3) != op(e3,op(e0,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e0),e3) != op(e3,op(e0,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 19 op(e0,e3) = e3. [assumption]. 34 op(e3,e0) = e3. [assumption]. 37 op(e3,e3) = e4. [assumption]. 59 op(op(e3,e0),e3) != op(e3,op(e0,e3)). [assumption]. 60 $F. [copy(59),rewrite([34(3),37(3),19(5),37(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11348 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 114 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e0),e4),op(e3,op(e0,e4)))). Max_seconds is 119 for this subproblem. Child search process 11349 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e0),e4) != op(e3,op(e0,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e0),e4) != op(e3,op(e0,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 20 op(e0,e4) = e4. [assumption]. 34 op(e3,e0) = e3. [assumption]. 38 op(e3,e4) = e0. [assumption]. 59 op(op(e3,e0),e4) != op(e3,op(e0,e4)). [assumption]. 60 $F. [copy(59),rewrite([34(3),38(3),20(5),38(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11349 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 115 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e0),e5),op(e3,op(e0,e5)))). Max_seconds is 119 for this subproblem. Child search process 11350 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e0),e5) != op(e3,op(e0,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e0),e5) != op(e3,op(e0,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 21 op(e0,e5) = e5. [assumption]. 34 op(e3,e0) = e3. [assumption]. 39 op(e3,e5) = e2. [assumption]. 59 op(op(e3,e0),e5) != op(e3,op(e0,e5)). [assumption]. 60 $F. [copy(59),rewrite([34(3),39(3),21(5),39(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11350 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 116 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e1),e0),op(e3,op(e1,e0)))). Max_seconds is 119 for this subproblem. Child search process 11351 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e1),e0) != op(e3,op(e1,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e1),e0) != op(e3,op(e1,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 22 op(e1,e0) = e1. [assumption]. 35 op(e3,e1) = e5. [assumption]. 46 op(e5,e0) = e5. [assumption]. 59 op(op(e3,e1),e0) != op(e3,op(e1,e0)). [assumption]. 60 $F. [copy(59),rewrite([35(3),46(3),22(5),35(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11351 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 117 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e1),e1),op(e3,op(e1,e1)))). Max_seconds is 119 for this subproblem. Child search process 11352 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e1),e1) != op(e3,op(e1,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e1),e1) != op(e3,op(e1,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 23 op(e1,e1) = e0. [assumption]. 34 op(e3,e0) = e3. [assumption]. 35 op(e3,e1) = e5. [assumption]. 47 op(e5,e1) = e3. [assumption]. 59 op(op(e3,e1),e1) != op(e3,op(e1,e1)). [assumption]. 60 $F. [copy(59),rewrite([35(3),47(3),23(5),34(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11352 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 118 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e1),e2),op(e3,op(e1,e2)))). Max_seconds is 118 for this subproblem. Child search process 11353 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e1),e2) != op(e3,op(e1,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e1),e2) != op(e3,op(e1,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 24 op(e1,e2) = e3. [assumption]. 35 op(e3,e1) = e5. [assumption]. 37 op(e3,e3) = e4. [assumption]. 48 op(e5,e2) = e4. [assumption]. 59 op(op(e3,e1),e2) != op(e3,op(e1,e2)). [assumption]. 60 $F. [copy(59),rewrite([35(3),48(3),24(5),37(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11353 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 119 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e1),e3),op(e3,op(e1,e3)))). Max_seconds is 118 for this subproblem. Child search process 11354 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e1),e3) != op(e3,op(e1,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e1),e3) != op(e3,op(e1,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 25 op(e1,e3) = e2. [assumption]. 35 op(e3,e1) = e5. [assumption]. 36 op(e3,e2) = e1. [assumption]. 49 op(e5,e3) = e1. [assumption]. 59 op(op(e3,e1),e3) != op(e3,op(e1,e3)). [assumption]. 60 $F. [copy(59),rewrite([35(3),49(3),25(5),36(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11354 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 120 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e1),e4),op(e3,op(e1,e4)))). Max_seconds is 118 for this subproblem. Child search process 11355 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e1),e4) != op(e3,op(e1,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e1),e4) != op(e3,op(e1,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 26 op(e1,e4) = e5. [assumption]. 35 op(e3,e1) = e5. [assumption]. 39 op(e3,e5) = e2. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e3,e1),e4) != op(e3,op(e1,e4)). [assumption]. 60 $F. [copy(59),rewrite([35(3),50(3),26(5),39(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11355 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 121 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e1),e5),op(e3,op(e1,e5)))). Max_seconds is 118 for this subproblem. Child search process 11356 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e1),e5) != op(e3,op(e1,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e1),e5) != op(e3,op(e1,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 27 op(e1,e5) = e4. [assumption]. 35 op(e3,e1) = e5. [assumption]. 38 op(e3,e4) = e0. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e3,e1),e5) != op(e3,op(e1,e5)). [assumption]. 60 $F. [copy(59),rewrite([35(3),51(3),27(5),38(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11356 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 122 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e2),e0),op(e3,op(e2,e0)))). Max_seconds is 118 for this subproblem. Child search process 11357 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e2),e0) != op(e3,op(e2,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e2),e0) != op(e3,op(e2,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 22 op(e1,e0) = e1. [assumption]. 28 op(e2,e0) = e2. [assumption]. 36 op(e3,e2) = e1. [assumption]. 59 op(op(e3,e2),e0) != op(e3,op(e2,e0)). [assumption]. 60 $F. [copy(59),rewrite([36(3),22(3),28(5),36(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11357 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 123 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e2),e1),op(e3,op(e2,e1)))). Max_seconds is 118 for this subproblem. Child search process 11358 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e2),e1) != op(e3,op(e2,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e2),e1) != op(e3,op(e2,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 23 op(e1,e1) = e0. [assumption]. 29 op(e2,e1) = e4. [assumption]. 36 op(e3,e2) = e1. [assumption]. 38 op(e3,e4) = e0. [assumption]. 59 op(op(e3,e2),e1) != op(e3,op(e2,e1)). [assumption]. 60 $F. [copy(59),rewrite([36(3),23(3),29(5),38(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11358 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 124 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e2),e2),op(e3,op(e2,e2)))). Max_seconds is 118 for this subproblem. Child search process 11359 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e2),e2) != op(e3,op(e2,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e2),e2) != op(e3,op(e2,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 24 op(e1,e2) = e3. [assumption]. 30 op(e2,e2) = e0. [assumption]. 34 op(e3,e0) = e3. [assumption]. 36 op(e3,e2) = e1. [assumption]. 59 op(op(e3,e2),e2) != op(e3,op(e2,e2)). [assumption]. 60 $F. [copy(59),rewrite([36(3),24(3),30(5),34(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11359 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 125 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e2),e3),op(e3,op(e2,e3)))). Max_seconds is 118 for this subproblem. Child search process 11360 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e2),e3) != op(e3,op(e2,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e2),e3) != op(e3,op(e2,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 25 op(e1,e3) = e2. [assumption]. 31 op(e2,e3) = e5. [assumption]. 36 op(e3,e2) = e1. [assumption]. 39 op(e3,e5) = e2. [assumption]. 59 op(op(e3,e2),e3) != op(e3,op(e2,e3)). [assumption]. 60 $F. [copy(59),rewrite([36(3),25(3),31(5),39(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11360 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 126 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e2),e4),op(e3,op(e2,e4)))). Max_seconds is 118 for this subproblem. Child search process 11361 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e2),e4) != op(e3,op(e2,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e2),e4) != op(e3,op(e2,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 26 op(e1,e4) = e5. [assumption]. 32 op(e2,e4) = e1. [assumption]. 35 op(e3,e1) = e5. [assumption]. 36 op(e3,e2) = e1. [assumption]. 59 op(op(e3,e2),e4) != op(e3,op(e2,e4)). [assumption]. 60 $F. [copy(59),rewrite([36(3),26(3),32(5),35(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11361 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 127 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e2),e5),op(e3,op(e2,e5)))). Max_seconds is 118 for this subproblem. Child search process 11362 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e2),e5) != op(e3,op(e2,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e2),e5) != op(e3,op(e2,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 27 op(e1,e5) = e4. [assumption]. 33 op(e2,e5) = e3. [assumption]. 36 op(e3,e2) = e1. [assumption]. 37 op(e3,e3) = e4. [assumption]. 59 op(op(e3,e2),e5) != op(e3,op(e2,e5)). [assumption]. 60 $F. [copy(59),rewrite([36(3),27(3),33(5),37(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11362 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 128 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e3),e0),op(e3,op(e3,e0)))). Max_seconds is 118 for this subproblem. Child search process 11363 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e3),e0) != op(e3,op(e3,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e3),e0) != op(e3,op(e3,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 34 op(e3,e0) = e3. [assumption]. 37 op(e3,e3) = e4. [assumption]. 40 op(e4,e0) = e4. [assumption]. 59 op(op(e3,e3),e0) != op(e3,op(e3,e0)). [assumption]. 60 $F. [copy(59),rewrite([37(3),40(3),34(5),37(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11363 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 129 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e3),e1),op(e3,op(e3,e1)))). Max_seconds is 118 for this subproblem. Child search process 11364 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e3),e1) != op(e3,op(e3,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e3),e1) != op(e3,op(e3,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 35 op(e3,e1) = e5. [assumption]. 37 op(e3,e3) = e4. [assumption]. 39 op(e3,e5) = e2. [assumption]. 41 op(e4,e1) = e2. [assumption]. 59 op(op(e3,e3),e1) != op(e3,op(e3,e1)). [assumption]. 60 $F. [copy(59),rewrite([37(3),41(3),35(5),39(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11364 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 130 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e3),e2),op(e3,op(e3,e2)))). Max_seconds is 118 for this subproblem. Child search process 11365 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e3),e2) != op(e3,op(e3,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e3),e2) != op(e3,op(e3,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 35 op(e3,e1) = e5. [assumption]. 36 op(e3,e2) = e1. [assumption]. 37 op(e3,e3) = e4. [assumption]. 42 op(e4,e2) = e5. [assumption]. 59 op(op(e3,e3),e2) != op(e3,op(e3,e2)). [assumption]. 60 $F. [copy(59),rewrite([37(3),42(3),36(5),35(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11365 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 131 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e3),e3),op(e3,op(e3,e3)))). Max_seconds is 118 for this subproblem. Child search process 11366 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e3),e3) != op(e3,op(e3,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e3),e3) != op(e3,op(e3,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 37 op(e3,e3) = e4. [assumption]. 38 op(e3,e4) = e0. [assumption]. 43 op(e4,e3) = e0. [assumption]. 59 op(op(e3,e3),e3) != op(e3,op(e3,e3)). [assumption]. 60 $F. [copy(59),rewrite([37(3),43(3),37(5),38(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11366 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 132 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e3),e4),op(e3,op(e3,e4)))). Max_seconds is 118 for this subproblem. Child search process 11367 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e3),e4) != op(e3,op(e3,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e3),e4) != op(e3,op(e3,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 34 op(e3,e0) = e3. [assumption]. 37 op(e3,e3) = e4. [assumption]. 38 op(e3,e4) = e0. [assumption]. 44 op(e4,e4) = e3. [assumption]. 59 op(op(e3,e3),e4) != op(e3,op(e3,e4)). [assumption]. 60 $F. [copy(59),rewrite([37(3),44(3),38(5),34(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11367 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 133 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e3),e5),op(e3,op(e3,e5)))). Max_seconds is 118 for this subproblem. Child search process 11368 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e3),e5) != op(e3,op(e3,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e3),e5) != op(e3,op(e3,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 36 op(e3,e2) = e1. [assumption]. 37 op(e3,e3) = e4. [assumption]. 39 op(e3,e5) = e2. [assumption]. 45 op(e4,e5) = e1. [assumption]. 59 op(op(e3,e3),e5) != op(e3,op(e3,e5)). [assumption]. 60 $F. [copy(59),rewrite([37(3),45(3),39(5),36(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11368 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 134 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e4),e0),op(e3,op(e4,e0)))). Max_seconds is 118 for this subproblem. Child search process 11369 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e4),e0) != op(e3,op(e4,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e4),e0) != op(e3,op(e4,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 38 op(e3,e4) = e0. [assumption]. 40 op(e4,e0) = e4. [assumption]. 59 op(op(e3,e4),e0) != op(e3,op(e4,e0)). [assumption]. 60 $F. [copy(59),rewrite([38(3),16(3),40(5),38(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11369 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 135 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e4),e1),op(e3,op(e4,e1)))). Max_seconds is 118 for this subproblem. Child search process 11370 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e4),e1) != op(e3,op(e4,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e4),e1) != op(e3,op(e4,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 36 op(e3,e2) = e1. [assumption]. 38 op(e3,e4) = e0. [assumption]. 41 op(e4,e1) = e2. [assumption]. 59 op(op(e3,e4),e1) != op(e3,op(e4,e1)). [assumption]. 60 $F. [copy(59),rewrite([38(3),17(3),41(5),36(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11370 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 136 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e4),e2),op(e3,op(e4,e2)))). Max_seconds is 118 for this subproblem. Child search process 11371 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e4),e2) != op(e3,op(e4,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e4),e2) != op(e3,op(e4,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 38 op(e3,e4) = e0. [assumption]. 39 op(e3,e5) = e2. [assumption]. 42 op(e4,e2) = e5. [assumption]. 59 op(op(e3,e4),e2) != op(e3,op(e4,e2)). [assumption]. 60 $F. [copy(59),rewrite([38(3),18(3),42(5),39(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11371 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 137 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e4),e3),op(e3,op(e4,e3)))). Max_seconds is 118 for this subproblem. Child search process 11372 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e4),e3) != op(e3,op(e4,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e4),e3) != op(e3,op(e4,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 19 op(e0,e3) = e3. [assumption]. 34 op(e3,e0) = e3. [assumption]. 38 op(e3,e4) = e0. [assumption]. 43 op(e4,e3) = e0. [assumption]. 59 op(op(e3,e4),e3) != op(e3,op(e4,e3)). [assumption]. 60 $F. [copy(59),rewrite([38(3),19(3),43(5),34(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11372 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 138 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e4),e4),op(e3,op(e4,e4)))). Max_seconds is 118 for this subproblem. Child search process 11373 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e4),e4) != op(e3,op(e4,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e4),e4) != op(e3,op(e4,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 20 op(e0,e4) = e4. [assumption]. 37 op(e3,e3) = e4. [assumption]. 38 op(e3,e4) = e0. [assumption]. 44 op(e4,e4) = e3. [assumption]. 59 op(op(e3,e4),e4) != op(e3,op(e4,e4)). [assumption]. 60 $F. [copy(59),rewrite([38(3),20(3),44(5),37(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11373 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 139 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e4),e5),op(e3,op(e4,e5)))). Max_seconds is 118 for this subproblem. Child search process 11374 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e4),e5) != op(e3,op(e4,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e4),e5) != op(e3,op(e4,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 21 op(e0,e5) = e5. [assumption]. 35 op(e3,e1) = e5. [assumption]. 38 op(e3,e4) = e0. [assumption]. 45 op(e4,e5) = e1. [assumption]. 59 op(op(e3,e4),e5) != op(e3,op(e4,e5)). [assumption]. 60 $F. [copy(59),rewrite([38(3),21(3),45(5),35(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11374 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 140 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e5),e0),op(e3,op(e5,e0)))). Max_seconds is 118 for this subproblem. Child search process 11375 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e5),e0) != op(e3,op(e5,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e5),e0) != op(e3,op(e5,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 28 op(e2,e0) = e2. [assumption]. 39 op(e3,e5) = e2. [assumption]. 46 op(e5,e0) = e5. [assumption]. 59 op(op(e3,e5),e0) != op(e3,op(e5,e0)). [assumption]. 60 $F. [copy(59),rewrite([39(3),28(3),46(5),39(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11375 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 141 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e5),e1),op(e3,op(e5,e1)))). Max_seconds is 118 for this subproblem. Child search process 11376 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e5),e1) != op(e3,op(e5,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e5),e1) != op(e3,op(e5,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 29 op(e2,e1) = e4. [assumption]. 37 op(e3,e3) = e4. [assumption]. 39 op(e3,e5) = e2. [assumption]. 47 op(e5,e1) = e3. [assumption]. 59 op(op(e3,e5),e1) != op(e3,op(e5,e1)). [assumption]. 60 $F. [copy(59),rewrite([39(3),29(3),47(5),37(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11376 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 142 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e5),e2),op(e3,op(e5,e2)))). Max_seconds is 118 for this subproblem. Child search process 11377 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e5),e2) != op(e3,op(e5,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e5),e2) != op(e3,op(e5,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 30 op(e2,e2) = e0. [assumption]. 38 op(e3,e4) = e0. [assumption]. 39 op(e3,e5) = e2. [assumption]. 48 op(e5,e2) = e4. [assumption]. 59 op(op(e3,e5),e2) != op(e3,op(e5,e2)). [assumption]. 60 $F. [copy(59),rewrite([39(3),30(3),48(5),38(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11377 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 143 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e5),e3),op(e3,op(e5,e3)))). Max_seconds is 118 for this subproblem. Child search process 11378 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e5),e3) != op(e3,op(e5,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e5),e3) != op(e3,op(e5,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 31 op(e2,e3) = e5. [assumption]. 35 op(e3,e1) = e5. [assumption]. 39 op(e3,e5) = e2. [assumption]. 49 op(e5,e3) = e1. [assumption]. 59 op(op(e3,e5),e3) != op(e3,op(e5,e3)). [assumption]. 60 $F. [copy(59),rewrite([39(3),31(3),49(5),35(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11378 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 144 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e5),e4),op(e3,op(e5,e4)))). Max_seconds is 118 for this subproblem. Child search process 11379 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e5),e4) != op(e3,op(e5,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e5),e4) != op(e3,op(e5,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 32 op(e2,e4) = e1. [assumption]. 36 op(e3,e2) = e1. [assumption]. 39 op(e3,e5) = e2. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e3,e5),e4) != op(e3,op(e5,e4)). [assumption]. 60 $F. [copy(59),rewrite([39(3),32(3),50(5),36(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11379 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 145 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e3,e5),e5),op(e3,op(e5,e5)))). Max_seconds is 118 for this subproblem. Child search process 11380 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e3,e5),e5) != op(e3,op(e5,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e3,e5),e5) != op(e3,op(e5,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 33 op(e2,e5) = e3. [assumption]. 34 op(e3,e0) = e3. [assumption]. 39 op(e3,e5) = e2. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e3,e5),e5) != op(e3,op(e5,e5)). [assumption]. 60 $F. [copy(59),rewrite([39(3),33(3),51(5),34(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11380 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 146 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e0),e0),op(e4,op(e0,e0)))). Max_seconds is 118 for this subproblem. Child search process 11381 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e0),e0) != op(e4,op(e0,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e0),e0) != op(e4,op(e0,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 40 op(e4,e0) = e4. [assumption]. 59 op(op(e4,e0),e0) != op(e4,op(e0,e0)). [assumption]. 60 $F. [copy(59),rewrite([40(3),40(3),16(5),40(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11381 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 147 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e0),e1),op(e4,op(e0,e1)))). Max_seconds is 118 for this subproblem. Child search process 11382 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e0),e1) != op(e4,op(e0,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e0),e1) != op(e4,op(e0,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 40 op(e4,e0) = e4. [assumption]. 41 op(e4,e1) = e2. [assumption]. 59 op(op(e4,e0),e1) != op(e4,op(e0,e1)). [assumption]. 60 $F. [copy(59),rewrite([40(3),41(3),17(5),41(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11382 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 148 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e0),e2),op(e4,op(e0,e2)))). Max_seconds is 118 for this subproblem. Child search process 11383 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e0),e2) != op(e4,op(e0,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e0),e2) != op(e4,op(e0,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 40 op(e4,e0) = e4. [assumption]. 42 op(e4,e2) = e5. [assumption]. 59 op(op(e4,e0),e2) != op(e4,op(e0,e2)). [assumption]. 60 $F. [copy(59),rewrite([40(3),42(3),18(5),42(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11383 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 149 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e0),e3),op(e4,op(e0,e3)))). Max_seconds is 118 for this subproblem. Child search process 11384 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e0),e3) != op(e4,op(e0,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e0),e3) != op(e4,op(e0,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 19 op(e0,e3) = e3. [assumption]. 40 op(e4,e0) = e4. [assumption]. 43 op(e4,e3) = e0. [assumption]. 59 op(op(e4,e0),e3) != op(e4,op(e0,e3)). [assumption]. 60 $F. [copy(59),rewrite([40(3),43(3),19(5),43(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11384 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 150 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e0),e4),op(e4,op(e0,e4)))). Max_seconds is 118 for this subproblem. Child search process 11385 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e0),e4) != op(e4,op(e0,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e0),e4) != op(e4,op(e0,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 20 op(e0,e4) = e4. [assumption]. 40 op(e4,e0) = e4. [assumption]. 44 op(e4,e4) = e3. [assumption]. 59 op(op(e4,e0),e4) != op(e4,op(e0,e4)). [assumption]. 60 $F. [copy(59),rewrite([40(3),44(3),20(5),44(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11385 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 151 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e0),e5),op(e4,op(e0,e5)))). Max_seconds is 118 for this subproblem. Child search process 11386 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e0),e5) != op(e4,op(e0,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e0),e5) != op(e4,op(e0,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 21 op(e0,e5) = e5. [assumption]. 40 op(e4,e0) = e4. [assumption]. 45 op(e4,e5) = e1. [assumption]. 59 op(op(e4,e0),e5) != op(e4,op(e0,e5)). [assumption]. 60 $F. [copy(59),rewrite([40(3),45(3),21(5),45(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11386 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 152 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e1),e0),op(e4,op(e1,e0)))). Max_seconds is 118 for this subproblem. Child search process 11387 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e1),e0) != op(e4,op(e1,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e1),e0) != op(e4,op(e1,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 22 op(e1,e0) = e1. [assumption]. 28 op(e2,e0) = e2. [assumption]. 41 op(e4,e1) = e2. [assumption]. 59 op(op(e4,e1),e0) != op(e4,op(e1,e0)). [assumption]. 60 $F. [copy(59),rewrite([41(3),28(3),22(5),41(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11387 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 153 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e1),e1),op(e4,op(e1,e1)))). Max_seconds is 118 for this subproblem. Child search process 11388 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e1),e1) != op(e4,op(e1,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e1),e1) != op(e4,op(e1,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 23 op(e1,e1) = e0. [assumption]. 29 op(e2,e1) = e4. [assumption]. 40 op(e4,e0) = e4. [assumption]. 41 op(e4,e1) = e2. [assumption]. 59 op(op(e4,e1),e1) != op(e4,op(e1,e1)). [assumption]. 60 $F. [copy(59),rewrite([41(3),29(3),23(5),40(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11388 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 154 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e1),e2),op(e4,op(e1,e2)))). Max_seconds is 118 for this subproblem. Child search process 11389 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e1),e2) != op(e4,op(e1,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e1),e2) != op(e4,op(e1,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 24 op(e1,e2) = e3. [assumption]. 30 op(e2,e2) = e0. [assumption]. 41 op(e4,e1) = e2. [assumption]. 43 op(e4,e3) = e0. [assumption]. 59 op(op(e4,e1),e2) != op(e4,op(e1,e2)). [assumption]. 60 $F. [copy(59),rewrite([41(3),30(3),24(5),43(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11389 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 155 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e1),e3),op(e4,op(e1,e3)))). Max_seconds is 118 for this subproblem. Child search process 11390 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e1),e3) != op(e4,op(e1,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e1),e3) != op(e4,op(e1,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 25 op(e1,e3) = e2. [assumption]. 31 op(e2,e3) = e5. [assumption]. 41 op(e4,e1) = e2. [assumption]. 42 op(e4,e2) = e5. [assumption]. 59 op(op(e4,e1),e3) != op(e4,op(e1,e3)). [assumption]. 60 $F. [copy(59),rewrite([41(3),31(3),25(5),42(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11390 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 156 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e1),e4),op(e4,op(e1,e4)))). Max_seconds is 118 for this subproblem. Child search process 11391 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e1),e4) != op(e4,op(e1,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e1),e4) != op(e4,op(e1,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 26 op(e1,e4) = e5. [assumption]. 32 op(e2,e4) = e1. [assumption]. 41 op(e4,e1) = e2. [assumption]. 45 op(e4,e5) = e1. [assumption]. 59 op(op(e4,e1),e4) != op(e4,op(e1,e4)). [assumption]. 60 $F. [copy(59),rewrite([41(3),32(3),26(5),45(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11391 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 157 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e1),e5),op(e4,op(e1,e5)))). Max_seconds is 118 for this subproblem. Child search process 11392 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e1),e5) != op(e4,op(e1,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e1),e5) != op(e4,op(e1,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 27 op(e1,e5) = e4. [assumption]. 33 op(e2,e5) = e3. [assumption]. 41 op(e4,e1) = e2. [assumption]. 44 op(e4,e4) = e3. [assumption]. 59 op(op(e4,e1),e5) != op(e4,op(e1,e5)). [assumption]. 60 $F. [copy(59),rewrite([41(3),33(3),27(5),44(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11392 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 158 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e2),e0),op(e4,op(e2,e0)))). Max_seconds is 118 for this subproblem. Child search process 11393 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e2),e0) != op(e4,op(e2,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e2),e0) != op(e4,op(e2,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 28 op(e2,e0) = e2. [assumption]. 42 op(e4,e2) = e5. [assumption]. 46 op(e5,e0) = e5. [assumption]. 59 op(op(e4,e2),e0) != op(e4,op(e2,e0)). [assumption]. 60 $F. [copy(59),rewrite([42(3),46(3),28(5),42(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11393 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 159 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e2),e1),op(e4,op(e2,e1)))). Max_seconds is 118 for this subproblem. Child search process 11394 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e2),e1) != op(e4,op(e2,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e2),e1) != op(e4,op(e2,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 29 op(e2,e1) = e4. [assumption]. 42 op(e4,e2) = e5. [assumption]. 44 op(e4,e4) = e3. [assumption]. 47 op(e5,e1) = e3. [assumption]. 59 op(op(e4,e2),e1) != op(e4,op(e2,e1)). [assumption]. 60 $F. [copy(59),rewrite([42(3),47(3),29(5),44(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11394 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 160 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e2),e2),op(e4,op(e2,e2)))). Max_seconds is 118 for this subproblem. Child search process 11395 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e2),e2) != op(e4,op(e2,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e2),e2) != op(e4,op(e2,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 30 op(e2,e2) = e0. [assumption]. 40 op(e4,e0) = e4. [assumption]. 42 op(e4,e2) = e5. [assumption]. 48 op(e5,e2) = e4. [assumption]. 59 op(op(e4,e2),e2) != op(e4,op(e2,e2)). [assumption]. 60 $F. [copy(59),rewrite([42(3),48(3),30(5),40(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11395 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 161 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e2),e3),op(e4,op(e2,e3)))). Max_seconds is 118 for this subproblem. Child search process 11396 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e2),e3) != op(e4,op(e2,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e2),e3) != op(e4,op(e2,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 31 op(e2,e3) = e5. [assumption]. 42 op(e4,e2) = e5. [assumption]. 45 op(e4,e5) = e1. [assumption]. 49 op(e5,e3) = e1. [assumption]. 59 op(op(e4,e2),e3) != op(e4,op(e2,e3)). [assumption]. 60 $F. [copy(59),rewrite([42(3),49(3),31(5),45(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11396 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 162 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e2),e4),op(e4,op(e2,e4)))). Max_seconds is 118 for this subproblem. Child search process 11397 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e2),e4) != op(e4,op(e2,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e2),e4) != op(e4,op(e2,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 32 op(e2,e4) = e1. [assumption]. 41 op(e4,e1) = e2. [assumption]. 42 op(e4,e2) = e5. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e4,e2),e4) != op(e4,op(e2,e4)). [assumption]. 60 $F. [copy(59),rewrite([42(3),50(3),32(5),41(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11397 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 163 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e2),e5),op(e4,op(e2,e5)))). Max_seconds is 118 for this subproblem. Child search process 11398 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e2),e5) != op(e4,op(e2,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e2),e5) != op(e4,op(e2,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 33 op(e2,e5) = e3. [assumption]. 42 op(e4,e2) = e5. [assumption]. 43 op(e4,e3) = e0. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e4,e2),e5) != op(e4,op(e2,e5)). [assumption]. 60 $F. [copy(59),rewrite([42(3),51(3),33(5),43(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11398 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 164 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e3),e0),op(e4,op(e3,e0)))). Max_seconds is 118 for this subproblem. Child search process 11399 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e3),e0) != op(e4,op(e3,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e3),e0) != op(e4,op(e3,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 34 op(e3,e0) = e3. [assumption]. 43 op(e4,e3) = e0. [assumption]. 59 op(op(e4,e3),e0) != op(e4,op(e3,e0)). [assumption]. 60 $F. [copy(59),rewrite([43(3),16(3),34(5),43(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11399 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 165 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e3),e1),op(e4,op(e3,e1)))). Max_seconds is 118 for this subproblem. Child search process 11400 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e3),e1) != op(e4,op(e3,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e3),e1) != op(e4,op(e3,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 35 op(e3,e1) = e5. [assumption]. 43 op(e4,e3) = e0. [assumption]. 45 op(e4,e5) = e1. [assumption]. 59 op(op(e4,e3),e1) != op(e4,op(e3,e1)). [assumption]. 60 $F. [copy(59),rewrite([43(3),17(3),35(5),45(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11400 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 166 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e3),e2),op(e4,op(e3,e2)))). Max_seconds is 118 for this subproblem. Child search process 11401 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e3),e2) != op(e4,op(e3,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e3),e2) != op(e4,op(e3,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 36 op(e3,e2) = e1. [assumption]. 41 op(e4,e1) = e2. [assumption]. 43 op(e4,e3) = e0. [assumption]. 59 op(op(e4,e3),e2) != op(e4,op(e3,e2)). [assumption]. 60 $F. [copy(59),rewrite([43(3),18(3),36(5),41(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11401 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 167 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e3),e3),op(e4,op(e3,e3)))). Max_seconds is 118 for this subproblem. Child search process 11402 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e3),e3) != op(e4,op(e3,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e3),e3) != op(e4,op(e3,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 19 op(e0,e3) = e3. [assumption]. 37 op(e3,e3) = e4. [assumption]. 43 op(e4,e3) = e0. [assumption]. 44 op(e4,e4) = e3. [assumption]. 59 op(op(e4,e3),e3) != op(e4,op(e3,e3)). [assumption]. 60 $F. [copy(59),rewrite([43(3),19(3),37(5),44(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11402 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 168 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e3),e4),op(e4,op(e3,e4)))). Max_seconds is 118 for this subproblem. Child search process 11403 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e3),e4) != op(e4,op(e3,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e3),e4) != op(e4,op(e3,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 20 op(e0,e4) = e4. [assumption]. 38 op(e3,e4) = e0. [assumption]. 40 op(e4,e0) = e4. [assumption]. 43 op(e4,e3) = e0. [assumption]. 59 op(op(e4,e3),e4) != op(e4,op(e3,e4)). [assumption]. 60 $F. [copy(59),rewrite([43(3),20(3),38(5),40(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11403 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 169 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e3),e5),op(e4,op(e3,e5)))). Max_seconds is 118 for this subproblem. Child search process 11404 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e3),e5) != op(e4,op(e3,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e3),e5) != op(e4,op(e3,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 21 op(e0,e5) = e5. [assumption]. 39 op(e3,e5) = e2. [assumption]. 42 op(e4,e2) = e5. [assumption]. 43 op(e4,e3) = e0. [assumption]. 59 op(op(e4,e3),e5) != op(e4,op(e3,e5)). [assumption]. 60 $F. [copy(59),rewrite([43(3),21(3),39(5),42(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11404 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 170 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e4),e0),op(e4,op(e4,e0)))). Max_seconds is 118 for this subproblem. Child search process 11405 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e4),e0) != op(e4,op(e4,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e4),e0) != op(e4,op(e4,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 34 op(e3,e0) = e3. [assumption]. 40 op(e4,e0) = e4. [assumption]. 44 op(e4,e4) = e3. [assumption]. 59 op(op(e4,e4),e0) != op(e4,op(e4,e0)). [assumption]. 60 $F. [copy(59),rewrite([44(3),34(3),40(5),44(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11405 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 171 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e4),e1),op(e4,op(e4,e1)))). Max_seconds is 118 for this subproblem. Child search process 11406 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e4),e1) != op(e4,op(e4,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e4),e1) != op(e4,op(e4,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 35 op(e3,e1) = e5. [assumption]. 41 op(e4,e1) = e2. [assumption]. 42 op(e4,e2) = e5. [assumption]. 44 op(e4,e4) = e3. [assumption]. 59 op(op(e4,e4),e1) != op(e4,op(e4,e1)). [assumption]. 60 $F. [copy(59),rewrite([44(3),35(3),41(5),42(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11406 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 172 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e4),e2),op(e4,op(e4,e2)))). Max_seconds is 118 for this subproblem. Child search process 11407 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e4),e2) != op(e4,op(e4,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e4),e2) != op(e4,op(e4,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 36 op(e3,e2) = e1. [assumption]. 42 op(e4,e2) = e5. [assumption]. 44 op(e4,e4) = e3. [assumption]. 45 op(e4,e5) = e1. [assumption]. 59 op(op(e4,e4),e2) != op(e4,op(e4,e2)). [assumption]. 60 $F. [copy(59),rewrite([44(3),36(3),42(5),45(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11407 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 173 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e4),e3),op(e4,op(e4,e3)))). Max_seconds is 118 for this subproblem. Child search process 11408 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e4),e3) != op(e4,op(e4,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e4),e3) != op(e4,op(e4,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 37 op(e3,e3) = e4. [assumption]. 40 op(e4,e0) = e4. [assumption]. 43 op(e4,e3) = e0. [assumption]. 44 op(e4,e4) = e3. [assumption]. 59 op(op(e4,e4),e3) != op(e4,op(e4,e3)). [assumption]. 60 $F. [copy(59),rewrite([44(3),37(3),43(5),40(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11408 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 174 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e4),e4),op(e4,op(e4,e4)))). Max_seconds is 118 for this subproblem. Child search process 11409 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e4),e4) != op(e4,op(e4,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e4),e4) != op(e4,op(e4,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 38 op(e3,e4) = e0. [assumption]. 43 op(e4,e3) = e0. [assumption]. 44 op(e4,e4) = e3. [assumption]. 59 op(op(e4,e4),e4) != op(e4,op(e4,e4)). [assumption]. 60 $F. [copy(59),rewrite([44(3),38(3),44(5),43(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11409 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 175 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e4),e5),op(e4,op(e4,e5)))). Max_seconds is 118 for this subproblem. Child search process 11410 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e4),e5) != op(e4,op(e4,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e4),e5) != op(e4,op(e4,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 39 op(e3,e5) = e2. [assumption]. 41 op(e4,e1) = e2. [assumption]. 44 op(e4,e4) = e3. [assumption]. 45 op(e4,e5) = e1. [assumption]. 59 op(op(e4,e4),e5) != op(e4,op(e4,e5)). [assumption]. 60 $F. [copy(59),rewrite([44(3),39(3),45(5),41(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11410 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 176 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e5),e0),op(e4,op(e5,e0)))). Max_seconds is 118 for this subproblem. Child search process 11411 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e5),e0) != op(e4,op(e5,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e5),e0) != op(e4,op(e5,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 22 op(e1,e0) = e1. [assumption]. 45 op(e4,e5) = e1. [assumption]. 46 op(e5,e0) = e5. [assumption]. 59 op(op(e4,e5),e0) != op(e4,op(e5,e0)). [assumption]. 60 $F. [copy(59),rewrite([45(3),22(3),46(5),45(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11411 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 177 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e5),e1),op(e4,op(e5,e1)))). Max_seconds is 118 for this subproblem. Child search process 11412 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e5),e1) != op(e4,op(e5,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e5),e1) != op(e4,op(e5,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 23 op(e1,e1) = e0. [assumption]. 43 op(e4,e3) = e0. [assumption]. 45 op(e4,e5) = e1. [assumption]. 47 op(e5,e1) = e3. [assumption]. 59 op(op(e4,e5),e1) != op(e4,op(e5,e1)). [assumption]. 60 $F. [copy(59),rewrite([45(3),23(3),47(5),43(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11412 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 178 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e5),e2),op(e4,op(e5,e2)))). Max_seconds is 118 for this subproblem. Child search process 11413 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e5),e2) != op(e4,op(e5,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e5),e2) != op(e4,op(e5,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 24 op(e1,e2) = e3. [assumption]. 44 op(e4,e4) = e3. [assumption]. 45 op(e4,e5) = e1. [assumption]. 48 op(e5,e2) = e4. [assumption]. 59 op(op(e4,e5),e2) != op(e4,op(e5,e2)). [assumption]. 60 $F. [copy(59),rewrite([45(3),24(3),48(5),44(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11413 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 179 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e5),e3),op(e4,op(e5,e3)))). Max_seconds is 118 for this subproblem. Child search process 11414 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e5),e3) != op(e4,op(e5,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e5),e3) != op(e4,op(e5,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 25 op(e1,e3) = e2. [assumption]. 41 op(e4,e1) = e2. [assumption]. 45 op(e4,e5) = e1. [assumption]. 49 op(e5,e3) = e1. [assumption]. 59 op(op(e4,e5),e3) != op(e4,op(e5,e3)). [assumption]. 60 $F. [copy(59),rewrite([45(3),25(3),49(5),41(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11414 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 180 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e5),e4),op(e4,op(e5,e4)))). Max_seconds is 118 for this subproblem. Child search process 11415 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e5),e4) != op(e4,op(e5,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e5),e4) != op(e4,op(e5,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 26 op(e1,e4) = e5. [assumption]. 42 op(e4,e2) = e5. [assumption]. 45 op(e4,e5) = e1. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e4,e5),e4) != op(e4,op(e5,e4)). [assumption]. 60 $F. [copy(59),rewrite([45(3),26(3),50(5),42(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11415 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 181 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e4,e5),e5),op(e4,op(e5,e5)))). Max_seconds is 118 for this subproblem. Child search process 11416 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e4,e5),e5) != op(e4,op(e5,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e4,e5),e5) != op(e4,op(e5,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 27 op(e1,e5) = e4. [assumption]. 40 op(e4,e0) = e4. [assumption]. 45 op(e4,e5) = e1. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e4,e5),e5) != op(e4,op(e5,e5)). [assumption]. 60 $F. [copy(59),rewrite([45(3),27(3),51(5),40(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11416 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 182 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e0),e0),op(e5,op(e0,e0)))). Max_seconds is 118 for this subproblem. Child search process 11417 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e0),e0) != op(e5,op(e0,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e0),e0) != op(e5,op(e0,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 46 op(e5,e0) = e5. [assumption]. 59 op(op(e5,e0),e0) != op(e5,op(e0,e0)). [assumption]. 60 $F. [copy(59),rewrite([46(3),46(3),16(5),46(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11417 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 183 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e0),e1),op(e5,op(e0,e1)))). Max_seconds is 118 for this subproblem. Child search process 11418 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e0),e1) != op(e5,op(e0,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e0),e1) != op(e5,op(e0,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 46 op(e5,e0) = e5. [assumption]. 47 op(e5,e1) = e3. [assumption]. 59 op(op(e5,e0),e1) != op(e5,op(e0,e1)). [assumption]. 60 $F. [copy(59),rewrite([46(3),47(3),17(5),47(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11418 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 184 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e0),e2),op(e5,op(e0,e2)))). Max_seconds is 118 for this subproblem. Child search process 11419 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e0),e2) != op(e5,op(e0,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e0),e2) != op(e5,op(e0,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 46 op(e5,e0) = e5. [assumption]. 48 op(e5,e2) = e4. [assumption]. 59 op(op(e5,e0),e2) != op(e5,op(e0,e2)). [assumption]. 60 $F. [copy(59),rewrite([46(3),48(3),18(5),48(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11419 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 185 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e0),e3),op(e5,op(e0,e3)))). Max_seconds is 118 for this subproblem. Child search process 11420 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e0),e3) != op(e5,op(e0,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e0),e3) != op(e5,op(e0,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 19 op(e0,e3) = e3. [assumption]. 46 op(e5,e0) = e5. [assumption]. 49 op(e5,e3) = e1. [assumption]. 59 op(op(e5,e0),e3) != op(e5,op(e0,e3)). [assumption]. 60 $F. [copy(59),rewrite([46(3),49(3),19(5),49(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11420 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 186 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e0),e4),op(e5,op(e0,e4)))). Max_seconds is 118 for this subproblem. Child search process 11421 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e0),e4) != op(e5,op(e0,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e0),e4) != op(e5,op(e0,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 20 op(e0,e4) = e4. [assumption]. 46 op(e5,e0) = e5. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e5,e0),e4) != op(e5,op(e0,e4)). [assumption]. 60 $F. [copy(59),rewrite([46(3),50(3),20(5),50(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11421 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 187 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e0),e5),op(e5,op(e0,e5)))). Max_seconds is 118 for this subproblem. Child search process 11422 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e0),e5) != op(e5,op(e0,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e0),e5) != op(e5,op(e0,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 21 op(e0,e5) = e5. [assumption]. 46 op(e5,e0) = e5. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e5,e0),e5) != op(e5,op(e0,e5)). [assumption]. 60 $F. [copy(59),rewrite([46(3),51(3),21(5),51(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11422 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 188 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e1),e0),op(e5,op(e1,e0)))). Max_seconds is 118 for this subproblem. Child search process 11423 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e1),e0) != op(e5,op(e1,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e1),e0) != op(e5,op(e1,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 22 op(e1,e0) = e1. [assumption]. 34 op(e3,e0) = e3. [assumption]. 47 op(e5,e1) = e3. [assumption]. 59 op(op(e5,e1),e0) != op(e5,op(e1,e0)). [assumption]. 60 $F. [copy(59),rewrite([47(3),34(3),22(5),47(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11423 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 189 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e1),e1),op(e5,op(e1,e1)))). Max_seconds is 118 for this subproblem. Child search process 11424 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e1),e1) != op(e5,op(e1,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e1),e1) != op(e5,op(e1,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 23 op(e1,e1) = e0. [assumption]. 35 op(e3,e1) = e5. [assumption]. 46 op(e5,e0) = e5. [assumption]. 47 op(e5,e1) = e3. [assumption]. 59 op(op(e5,e1),e1) != op(e5,op(e1,e1)). [assumption]. 60 $F. [copy(59),rewrite([47(3),35(3),23(5),46(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11424 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 190 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e1),e2),op(e5,op(e1,e2)))). Max_seconds is 118 for this subproblem. Child search process 11425 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e1),e2) != op(e5,op(e1,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e1),e2) != op(e5,op(e1,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 24 op(e1,e2) = e3. [assumption]. 36 op(e3,e2) = e1. [assumption]. 47 op(e5,e1) = e3. [assumption]. 49 op(e5,e3) = e1. [assumption]. 59 op(op(e5,e1),e2) != op(e5,op(e1,e2)). [assumption]. 60 $F. [copy(59),rewrite([47(3),36(3),24(5),49(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11425 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 191 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e1),e3),op(e5,op(e1,e3)))). Max_seconds is 118 for this subproblem. Child search process 11426 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e1),e3) != op(e5,op(e1,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e1),e3) != op(e5,op(e1,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 25 op(e1,e3) = e2. [assumption]. 37 op(e3,e3) = e4. [assumption]. 47 op(e5,e1) = e3. [assumption]. 48 op(e5,e2) = e4. [assumption]. 59 op(op(e5,e1),e3) != op(e5,op(e1,e3)). [assumption]. 60 $F. [copy(59),rewrite([47(3),37(3),25(5),48(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11426 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 192 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e1),e4),op(e5,op(e1,e4)))). Max_seconds is 118 for this subproblem. Child search process 11427 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e1),e4) != op(e5,op(e1,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e1),e4) != op(e5,op(e1,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 26 op(e1,e4) = e5. [assumption]. 38 op(e3,e4) = e0. [assumption]. 47 op(e5,e1) = e3. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e5,e1),e4) != op(e5,op(e1,e4)). [assumption]. 60 $F. [copy(59),rewrite([47(3),38(3),26(5),51(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11427 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 193 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e1),e5),op(e5,op(e1,e5)))). Max_seconds is 118 for this subproblem. Child search process 11428 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e1),e5) != op(e5,op(e1,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e1),e5) != op(e5,op(e1,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 27 op(e1,e5) = e4. [assumption]. 39 op(e3,e5) = e2. [assumption]. 47 op(e5,e1) = e3. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e5,e1),e5) != op(e5,op(e1,e5)). [assumption]. 60 $F. [copy(59),rewrite([47(3),39(3),27(5),50(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11428 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 194 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e2),e0),op(e5,op(e2,e0)))). Max_seconds is 118 for this subproblem. Child search process 11429 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e2),e0) != op(e5,op(e2,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e2),e0) != op(e5,op(e2,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 28 op(e2,e0) = e2. [assumption]. 40 op(e4,e0) = e4. [assumption]. 48 op(e5,e2) = e4. [assumption]. 59 op(op(e5,e2),e0) != op(e5,op(e2,e0)). [assumption]. 60 $F. [copy(59),rewrite([48(3),40(3),28(5),48(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11429 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 195 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e2),e1),op(e5,op(e2,e1)))). Max_seconds is 118 for this subproblem. Child search process 11430 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e2),e1) != op(e5,op(e2,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e2),e1) != op(e5,op(e2,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 29 op(e2,e1) = e4. [assumption]. 41 op(e4,e1) = e2. [assumption]. 48 op(e5,e2) = e4. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e5,e2),e1) != op(e5,op(e2,e1)). [assumption]. 60 $F. [copy(59),rewrite([48(3),41(3),29(5),50(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11430 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 196 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e2),e2),op(e5,op(e2,e2)))). Max_seconds is 118 for this subproblem. Child search process 11431 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e2),e2) != op(e5,op(e2,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e2),e2) != op(e5,op(e2,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 30 op(e2,e2) = e0. [assumption]. 42 op(e4,e2) = e5. [assumption]. 46 op(e5,e0) = e5. [assumption]. 48 op(e5,e2) = e4. [assumption]. 59 op(op(e5,e2),e2) != op(e5,op(e2,e2)). [assumption]. 60 $F. [copy(59),rewrite([48(3),42(3),30(5),46(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11431 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 197 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e2),e3),op(e5,op(e2,e3)))). Max_seconds is 118 for this subproblem. Child search process 11432 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e2),e3) != op(e5,op(e2,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e2),e3) != op(e5,op(e2,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 31 op(e2,e3) = e5. [assumption]. 43 op(e4,e3) = e0. [assumption]. 48 op(e5,e2) = e4. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e5,e2),e3) != op(e5,op(e2,e3)). [assumption]. 60 $F. [copy(59),rewrite([48(3),43(3),31(5),51(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11432 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 198 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e2),e4),op(e5,op(e2,e4)))). Max_seconds is 118 for this subproblem. Child search process 11433 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e2),e4) != op(e5,op(e2,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e2),e4) != op(e5,op(e2,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 32 op(e2,e4) = e1. [assumption]. 44 op(e4,e4) = e3. [assumption]. 47 op(e5,e1) = e3. [assumption]. 48 op(e5,e2) = e4. [assumption]. 59 op(op(e5,e2),e4) != op(e5,op(e2,e4)). [assumption]. 60 $F. [copy(59),rewrite([48(3),44(3),32(5),47(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11433 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 199 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e2),e5),op(e5,op(e2,e5)))). Max_seconds is 118 for this subproblem. Child search process 11434 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e2),e5) != op(e5,op(e2,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e2),e5) != op(e5,op(e2,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 33 op(e2,e5) = e3. [assumption]. 45 op(e4,e5) = e1. [assumption]. 48 op(e5,e2) = e4. [assumption]. 49 op(e5,e3) = e1. [assumption]. 59 op(op(e5,e2),e5) != op(e5,op(e2,e5)). [assumption]. 60 $F. [copy(59),rewrite([48(3),45(3),33(5),49(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11434 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 200 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e3),e0),op(e5,op(e3,e0)))). Max_seconds is 118 for this subproblem. Child search process 11435 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e3),e0) != op(e5,op(e3,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e3),e0) != op(e5,op(e3,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 22 op(e1,e0) = e1. [assumption]. 34 op(e3,e0) = e3. [assumption]. 49 op(e5,e3) = e1. [assumption]. 59 op(op(e5,e3),e0) != op(e5,op(e3,e0)). [assumption]. 60 $F. [copy(59),rewrite([49(3),22(3),34(5),49(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11435 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 201 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e3),e1),op(e5,op(e3,e1)))). Max_seconds is 118 for this subproblem. Child search process 11436 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e3),e1) != op(e5,op(e3,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e3),e1) != op(e5,op(e3,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 23 op(e1,e1) = e0. [assumption]. 35 op(e3,e1) = e5. [assumption]. 49 op(e5,e3) = e1. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e5,e3),e1) != op(e5,op(e3,e1)). [assumption]. 60 $F. [copy(59),rewrite([49(3),23(3),35(5),51(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11436 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 202 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e3),e2),op(e5,op(e3,e2)))). Max_seconds is 118 for this subproblem. Child search process 11437 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e3),e2) != op(e5,op(e3,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e3),e2) != op(e5,op(e3,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 24 op(e1,e2) = e3. [assumption]. 36 op(e3,e2) = e1. [assumption]. 47 op(e5,e1) = e3. [assumption]. 49 op(e5,e3) = e1. [assumption]. 59 op(op(e5,e3),e2) != op(e5,op(e3,e2)). [assumption]. 60 $F. [copy(59),rewrite([49(3),24(3),36(5),47(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11437 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 203 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e3),e3),op(e5,op(e3,e3)))). Max_seconds is 118 for this subproblem. Child search process 11438 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e3),e3) != op(e5,op(e3,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e3),e3) != op(e5,op(e3,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 25 op(e1,e3) = e2. [assumption]. 37 op(e3,e3) = e4. [assumption]. 49 op(e5,e3) = e1. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e5,e3),e3) != op(e5,op(e3,e3)). [assumption]. 60 $F. [copy(59),rewrite([49(3),25(3),37(5),50(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11438 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 204 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e3),e4),op(e5,op(e3,e4)))). Max_seconds is 118 for this subproblem. Child search process 11439 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e3),e4) != op(e5,op(e3,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e3),e4) != op(e5,op(e3,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 26 op(e1,e4) = e5. [assumption]. 38 op(e3,e4) = e0. [assumption]. 46 op(e5,e0) = e5. [assumption]. 49 op(e5,e3) = e1. [assumption]. 59 op(op(e5,e3),e4) != op(e5,op(e3,e4)). [assumption]. 60 $F. [copy(59),rewrite([49(3),26(3),38(5),46(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11439 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 205 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e3),e5),op(e5,op(e3,e5)))). Max_seconds is 118 for this subproblem. Child search process 11440 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e3),e5) != op(e5,op(e3,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e3),e5) != op(e5,op(e3,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 27 op(e1,e5) = e4. [assumption]. 39 op(e3,e5) = e2. [assumption]. 48 op(e5,e2) = e4. [assumption]. 49 op(e5,e3) = e1. [assumption]. 59 op(op(e5,e3),e5) != op(e5,op(e3,e5)). [assumption]. 60 $F. [copy(59),rewrite([49(3),27(3),39(5),48(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11440 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 206 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e4),e0),op(e5,op(e4,e0)))). Max_seconds is 118 for this subproblem. Child search process 11441 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e4),e0) != op(e5,op(e4,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e4),e0) != op(e5,op(e4,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 28 op(e2,e0) = e2. [assumption]. 40 op(e4,e0) = e4. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e5,e4),e0) != op(e5,op(e4,e0)). [assumption]. 60 $F. [copy(59),rewrite([50(3),28(3),40(5),50(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11441 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 207 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e4),e1),op(e5,op(e4,e1)))). Max_seconds is 118 for this subproblem. Child search process 11442 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e4),e1) != op(e5,op(e4,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e4),e1) != op(e5,op(e4,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 29 op(e2,e1) = e4. [assumption]. 41 op(e4,e1) = e2. [assumption]. 48 op(e5,e2) = e4. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e5,e4),e1) != op(e5,op(e4,e1)). [assumption]. 60 $F. [copy(59),rewrite([50(3),29(3),41(5),48(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11442 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 208 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e4),e2),op(e5,op(e4,e2)))). Max_seconds is 118 for this subproblem. Child search process 11443 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e4),e2) != op(e5,op(e4,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e4),e2) != op(e5,op(e4,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 30 op(e2,e2) = e0. [assumption]. 42 op(e4,e2) = e5. [assumption]. 50 op(e5,e4) = e2. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e5,e4),e2) != op(e5,op(e4,e2)). [assumption]. 60 $F. [copy(59),rewrite([50(3),30(3),42(5),51(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11443 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 209 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e4),e3),op(e5,op(e4,e3)))). Max_seconds is 118 for this subproblem. Child search process 11444 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e4),e3) != op(e5,op(e4,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e4),e3) != op(e5,op(e4,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 31 op(e2,e3) = e5. [assumption]. 43 op(e4,e3) = e0. [assumption]. 46 op(e5,e0) = e5. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e5,e4),e3) != op(e5,op(e4,e3)). [assumption]. 60 $F. [copy(59),rewrite([50(3),31(3),43(5),46(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11444 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 210 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e4),e4),op(e5,op(e4,e4)))). Max_seconds is 118 for this subproblem. Child search process 11445 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e4),e4) != op(e5,op(e4,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e4),e4) != op(e5,op(e4,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 32 op(e2,e4) = e1. [assumption]. 44 op(e4,e4) = e3. [assumption]. 49 op(e5,e3) = e1. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e5,e4),e4) != op(e5,op(e4,e4)). [assumption]. 60 $F. [copy(59),rewrite([50(3),32(3),44(5),49(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11445 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 211 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e4),e5),op(e5,op(e4,e5)))). Max_seconds is 118 for this subproblem. Child search process 11446 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e4),e5) != op(e5,op(e4,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e4),e5) != op(e5,op(e4,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 33 op(e2,e5) = e3. [assumption]. 45 op(e4,e5) = e1. [assumption]. 47 op(e5,e1) = e3. [assumption]. 50 op(e5,e4) = e2. [assumption]. 59 op(op(e5,e4),e5) != op(e5,op(e4,e5)). [assumption]. 60 $F. [copy(59),rewrite([50(3),33(3),45(5),47(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11446 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 212 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e5),e0),op(e5,op(e5,e0)))). Max_seconds is 118 for this subproblem. Child search process 11447 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e5),e0) != op(e5,op(e5,e0)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e5),e0) != op(e5,op(e5,e0)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 46 op(e5,e0) = e5. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e5,e5),e0) != op(e5,op(e5,e0)). [assumption]. 60 $F. [copy(59),rewrite([51(3),16(3),46(5),51(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11447 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 213 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e5),e1),op(e5,op(e5,e1)))). Max_seconds is 118 for this subproblem. Child search process 11448 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e5),e1) != op(e5,op(e5,e1)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e5),e1) != op(e5,op(e5,e1)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 47 op(e5,e1) = e3. [assumption]. 49 op(e5,e3) = e1. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e5,e5),e1) != op(e5,op(e5,e1)). [assumption]. 60 $F. [copy(59),rewrite([51(3),17(3),47(5),49(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11448 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 214 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e5),e2),op(e5,op(e5,e2)))). Max_seconds is 118 for this subproblem. Child search process 11449 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e5),e2) != op(e5,op(e5,e2)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e5),e2) != op(e5,op(e5,e2)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 48 op(e5,e2) = e4. [assumption]. 50 op(e5,e4) = e2. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e5,e5),e2) != op(e5,op(e5,e2)). [assumption]. 60 $F. [copy(59),rewrite([51(3),18(3),48(5),50(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11449 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 215 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e5),e3),op(e5,op(e5,e3)))). Max_seconds is 118 for this subproblem. Child search process 11450 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e5),e3) != op(e5,op(e5,e3)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e5),e3) != op(e5,op(e5,e3)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 19 op(e0,e3) = e3. [assumption]. 47 op(e5,e1) = e3. [assumption]. 49 op(e5,e3) = e1. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e5,e5),e3) != op(e5,op(e5,e3)). [assumption]. 60 $F. [copy(59),rewrite([51(3),19(3),49(5),47(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11450 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 216 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e5),e4),op(e5,op(e5,e4)))). Max_seconds is 118 for this subproblem. Child search process 11451 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e5),e4) != op(e5,op(e5,e4)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e5),e4) != op(e5,op(e5,e4)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 6. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 20 op(e0,e4) = e4. [assumption]. 48 op(e5,e2) = e4. [assumption]. 50 op(e5,e4) = e2. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e5,e5),e4) != op(e5,op(e5,e4)). [assumption]. 60 $F. [copy(59),rewrite([51(3),20(3),50(5),48(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11451 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 217 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(op(e5,e5),e5),op(e5,op(e5,e5)))). Max_seconds is 118 for this subproblem. Child search process 11452 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(op(e5,e5),e5) != op(e5,op(e5,e5)). [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(op(e5,e5),e5) != op(e5,op(e5,e5)). [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 21 op(e0,e5) = e5. [assumption]. 46 op(e5,e0) = e5. [assumption]. 51 op(e5,e5) = e0. [assumption]. 59 op(op(e5,e5),e5) != op(e5,op(e5,e5)). [assumption]. 60 $F. [copy(59),rewrite([51(3),21(3),51(5),46(4)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=419. Demod_rewrites=4. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11452 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 218 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(unit,e0),e0)). Max_seconds is 118 for this subproblem. Child search process 11453 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(unit,e0) != e0. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(unit,e0) != e0. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 52 unit = e0. [assumption]. 59 op(unit,e0) != e0. [assumption]. 60 $F. [copy(59),rewrite([52(1),16(3)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=411. Demod_rewrites=2. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11453 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 219 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(e0,unit),e0)). Max_seconds is 118 for this subproblem. Child search process 11454 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(e0,unit) != e0. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(e0,unit) != e0. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 52 unit = e0. [assumption]. 59 op(e0,unit) != e0. [assumption]. 60 $F. [copy(59),rewrite([52(2),16(3)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=411. Demod_rewrites=2. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11454 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 220 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(unit,e1),e1)). Max_seconds is 118 for this subproblem. Child search process 11455 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(unit,e1) != e1. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(unit,e1) != e1. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 17 op(e0,e1) = e1. [assumption]. 52 unit = e0. [assumption]. 59 op(unit,e1) != e1. [assumption]. 60 $F. [copy(59),rewrite([52(1),17(3)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=411. Demod_rewrites=2. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11455 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 221 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(e1,unit),e1)). Max_seconds is 118 for this subproblem. Child search process 11456 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(e1,unit) != e1. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(e1,unit) != e1. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 22 op(e1,e0) = e1. [assumption]. 52 unit = e0. [assumption]. 59 op(e1,unit) != e1. [assumption]. 60 $F. [copy(59),rewrite([52(2),22(3)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=411. Demod_rewrites=2. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11456 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 222 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(unit,e2),e2)). Max_seconds is 118 for this subproblem. Child search process 11457 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(unit,e2) != e2. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(unit,e2) != e2. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 18 op(e0,e2) = e2. [assumption]. 52 unit = e0. [assumption]. 59 op(unit,e2) != e2. [assumption]. 60 $F. [copy(59),rewrite([52(1),18(3)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=411. Demod_rewrites=2. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11457 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 223 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(e2,unit),e2)). Max_seconds is 118 for this subproblem. Child search process 11458 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(e2,unit) != e2. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(e2,unit) != e2. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 28 op(e2,e0) = e2. [assumption]. 52 unit = e0. [assumption]. 59 op(e2,unit) != e2. [assumption]. 60 $F. [copy(59),rewrite([52(2),28(3)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=411. Demod_rewrites=2. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11458 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 224 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(unit,e3),e3)). Max_seconds is 118 for this subproblem. Child search process 11459 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(unit,e3) != e3. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(unit,e3) != e3. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 19 op(e0,e3) = e3. [assumption]. 52 unit = e0. [assumption]. 59 op(unit,e3) != e3. [assumption]. 60 $F. [copy(59),rewrite([52(1),19(3)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=411. Demod_rewrites=2. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11459 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 225 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(e3,unit),e3)). Max_seconds is 118 for this subproblem. Child search process 11460 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(e3,unit) != e3. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(e3,unit) != e3. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 34 op(e3,e0) = e3. [assumption]. 52 unit = e0. [assumption]. 59 op(e3,unit) != e3. [assumption]. 60 $F. [copy(59),rewrite([52(2),34(3)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=411. Demod_rewrites=2. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11460 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 226 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(unit,e4),e4)). Max_seconds is 118 for this subproblem. Child search process 11461 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(unit,e4) != e4. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(unit,e4) != e4. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 20 op(e0,e4) = e4. [assumption]. 52 unit = e0. [assumption]. 59 op(unit,e4) != e4. [assumption]. 60 $F. [copy(59),rewrite([52(1),20(3)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=411. Demod_rewrites=2. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11461 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 227 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(e4,unit),e4)). Max_seconds is 118 for this subproblem. Child search process 11462 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(e4,unit) != e4. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(e4,unit) != e4. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 40 op(e4,e0) = e4. [assumption]. 52 unit = e0. [assumption]. 59 op(e4,unit) != e4. [assumption]. 60 $F. [copy(59),rewrite([52(2),40(3)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=411. Demod_rewrites=2. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11462 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 228 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(unit,e5),e5)). Max_seconds is 118 for this subproblem. Child search process 11463 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(unit,e5) != e5. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(unit,e5) != e5. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 21 op(e0,e5) = e5. [assumption]. 52 unit = e0. [assumption]. 59 op(unit,e5) != e5. [assumption]. 60 $F. [copy(59),rewrite([52(1),21(3)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=411. Demod_rewrites=2. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11463 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 229 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(e5,unit),e5)). Max_seconds is 118 for this subproblem. Child search process 11464 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(e5,unit) != e5. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(e5,unit) != e5. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 4. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 46 op(e5,e0) = e5. [assumption]. 52 unit = e0. [assumption]. 59 op(e5,unit) != e5. [assumption]. 60 $F. [copy(59),rewrite([52(2),46(3)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=411. Demod_rewrites=2. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11464 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 230 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(e0,inv(e0)),unit)). Max_seconds is 118 for this subproblem. Child search process 11465 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(e0,inv(e0)) != unit. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(e0,inv(e0)) != unit. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 52 unit = e0. [assumption]. 53 inv(e0) = e0. [assumption]. 59 op(e0,inv(e0)) != unit. [assumption]. 60 $F. [copy(59),rewrite([53(3),16(3),52(2)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=413. Demod_rewrites=3. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11465 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 231 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(inv(e0),e0),unit)). Max_seconds is 118 for this subproblem. Child search process 11466 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(inv(e0),e0) != unit. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(inv(e0),e0) != unit. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 16 op(e0,e0) = e0. [assumption]. 52 unit = e0. [assumption]. 53 inv(e0) = e0. [assumption]. 59 op(inv(e0),e0) != unit. [assumption]. 60 $F. [copy(59),rewrite([53(2),16(3),52(2)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=413. Demod_rewrites=3. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11466 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 232 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(e1,inv(e1)),unit)). Max_seconds is 118 for this subproblem. Child search process 11467 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(e1,inv(e1)) != unit. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(e1,inv(e1)) != unit. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 23 op(e1,e1) = e0. [assumption]. 52 unit = e0. [assumption]. 54 inv(e1) = e1. [assumption]. 59 op(e1,inv(e1)) != unit. [assumption]. 60 $F. [copy(59),rewrite([54(3),23(3),52(2)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=413. Demod_rewrites=3. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11467 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 233 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(inv(e1),e1),unit)). Max_seconds is 118 for this subproblem. Child search process 11468 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(inv(e1),e1) != unit. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(inv(e1),e1) != unit. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 23 op(e1,e1) = e0. [assumption]. 52 unit = e0. [assumption]. 54 inv(e1) = e1. [assumption]. 59 op(inv(e1),e1) != unit. [assumption]. 60 $F. [copy(59),rewrite([54(2),23(3),52(2)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=413. Demod_rewrites=3. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11468 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 234 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(e2,inv(e2)),unit)). Max_seconds is 118 for this subproblem. Child search process 11469 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(e2,inv(e2)) != unit. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(e2,inv(e2)) != unit. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 30 op(e2,e2) = e0. [assumption]. 52 unit = e0. [assumption]. 55 inv(e2) = e2. [assumption]. 59 op(e2,inv(e2)) != unit. [assumption]. 60 $F. [copy(59),rewrite([55(3),30(3),52(2)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=413. Demod_rewrites=3. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11469 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 235 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(inv(e2),e2),unit)). Max_seconds is 118 for this subproblem. Child search process 11470 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(inv(e2),e2) != unit. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(inv(e2),e2) != unit. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 30 op(e2,e2) = e0. [assumption]. 52 unit = e0. [assumption]. 55 inv(e2) = e2. [assumption]. 59 op(inv(e2),e2) != unit. [assumption]. 60 $F. [copy(59),rewrite([55(2),30(3),52(2)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=413. Demod_rewrites=3. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11470 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 236 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(e3,inv(e3)),unit)). Max_seconds is 118 for this subproblem. Child search process 11471 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(e3,inv(e3)) != unit. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(e3,inv(e3)) != unit. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 38 op(e3,e4) = e0. [assumption]. 52 unit = e0. [assumption]. 56 inv(e3) = e4. [assumption]. 59 op(e3,inv(e3)) != unit. [assumption]. 60 $F. [copy(59),rewrite([56(3),38(3),52(2)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=413. Demod_rewrites=3. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11471 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 237 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(inv(e3),e3),unit)). Max_seconds is 118 for this subproblem. Child search process 11472 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(inv(e3),e3) != unit. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(inv(e3),e3) != unit. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 43 op(e4,e3) = e0. [assumption]. 52 unit = e0. [assumption]. 56 inv(e3) = e4. [assumption]. 59 op(inv(e3),e3) != unit. [assumption]. 60 $F. [copy(59),rewrite([56(2),43(3),52(2)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=413. Demod_rewrites=3. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11472 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 238 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(e4,inv(e4)),unit)). Max_seconds is 118 for this subproblem. Child search process 11473 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(e4,inv(e4)) != unit. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(e4,inv(e4)) != unit. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 43 op(e4,e3) = e0. [assumption]. 52 unit = e0. [assumption]. 57 inv(e4) = e3. [assumption]. 59 op(e4,inv(e4)) != unit. [assumption]. 60 $F. [copy(59),rewrite([57(3),43(3),52(2)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=413. Demod_rewrites=3. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11473 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 239 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(inv(e4),e4),unit)). Max_seconds is 118 for this subproblem. Child search process 11474 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(inv(e4),e4) != unit. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(inv(e4),e4) != unit. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 38 op(e3,e4) = e0. [assumption]. 52 unit = e0. [assumption]. 57 inv(e4) = e3. [assumption]. 59 op(inv(e4),e4) != unit. [assumption]. 60 $F. [copy(59),rewrite([57(2),38(3),52(2)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=413. Demod_rewrites=3. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11474 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 240 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(e5,inv(e5)),unit)). Max_seconds is 118 for this subproblem. Child search process 11475 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(e5,inv(e5)) != unit. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(e5,inv(e5)) != unit. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 51 op(e5,e5) = e0. [assumption]. 52 unit = e0. [assumption]. 58 inv(e5) = e5. [assumption]. 59 op(e5,inv(e5)) != unit. [assumption]. 60 $F. [copy(59),rewrite([58(3),51(3),52(2)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=413. Demod_rewrites=3. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11475 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== continuing FOF reduction multisearch == Subproblem 241 of 241 (negated): (- =(e1,e0) & - =(e2,e0) & - =(e3,e0) & - =(e4,e0) & - =(e5,e0) & - =(e2,e1) & - =(e3,e1) & - =(e4,e1) & - =(e5,e1) & - =(e3,e2) & - =(e4,e2) & - =(e5,e2) & - =(e4,e3) & - =(e5,e3) & - =(e5,e4) & =(op(e0,e0),e0) & =(op(e0,e1),e1) & =(op(e0,e2),e2) & =(op(e0,e3),e3) & =(op(e0,e4),e4) & =(op(e0,e5),e5) & =(op(e1,e0),e1) & =(op(e1,e1),e0) & =(op(e1,e2),e3) & =(op(e1,e3),e2) & =(op(e1,e4),e5) & =(op(e1,e5),e4) & =(op(e2,e0),e2) & =(op(e2,e1),e4) & =(op(e2,e2),e0) & =(op(e2,e3),e5) & =(op(e2,e4),e1) & =(op(e2,e5),e3) & =(op(e3,e0),e3) & =(op(e3,e1),e5) & =(op(e3,e2),e1) & =(op(e3,e3),e4) & =(op(e3,e4),e0) & =(op(e3,e5),e2) & =(op(e4,e0),e4) & =(op(e4,e1),e2) & =(op(e4,e2),e5) & =(op(e4,e3),e0) & =(op(e4,e4),e3) & =(op(e4,e5),e1) & =(op(e5,e0),e5) & =(op(e5,e1),e3) & =(op(e5,e2),e4) & =(op(e5,e3),e1) & =(op(e5,e4),e2) & =(op(e5,e5),e0) & =(unit,e0) & =(inv(e0),e0) & =(inv(e1),e1) & =(inv(e2),e2) & =(inv(e3),e4) & =(inv(e4),e3) & =(inv(e5),e5) & - =(op(inv(e5),e5),unit)). Max_seconds is 118 for this subproblem. Child search process 11476 started. ============================== PROCESS INITIAL CLAUSES =============== % Clauses before input processing: formulas(usable). end_of_list. formulas(sos). e1 != e0. [assumption]. e2 != e0. [assumption]. e3 != e0. [assumption]. e4 != e0. [assumption]. e5 != e0. [assumption]. e2 != e1. [assumption]. e3 != e1. [assumption]. e4 != e1. [assumption]. e5 != e1. [assumption]. e3 != e2. [assumption]. e4 != e2. [assumption]. e5 != e2. [assumption]. e4 != e3. [assumption]. e5 != e3. [assumption]. e5 != e4. [assumption]. op(e0,e0) = e0. [assumption]. op(e0,e1) = e1. [assumption]. op(e0,e2) = e2. [assumption]. op(e0,e3) = e3. [assumption]. op(e0,e4) = e4. [assumption]. op(e0,e5) = e5. [assumption]. op(e1,e0) = e1. [assumption]. op(e1,e1) = e0. [assumption]. op(e1,e2) = e3. [assumption]. op(e1,e3) = e2. [assumption]. op(e1,e4) = e5. [assumption]. op(e1,e5) = e4. [assumption]. op(e2,e0) = e2. [assumption]. op(e2,e1) = e4. [assumption]. op(e2,e2) = e0. [assumption]. op(e2,e3) = e5. [assumption]. op(e2,e4) = e1. [assumption]. op(e2,e5) = e3. [assumption]. op(e3,e0) = e3. [assumption]. op(e3,e1) = e5. [assumption]. op(e3,e2) = e1. [assumption]. op(e3,e3) = e4. [assumption]. op(e3,e4) = e0. [assumption]. op(e3,e5) = e2. [assumption]. op(e4,e0) = e4. [assumption]. op(e4,e1) = e2. [assumption]. op(e4,e2) = e5. [assumption]. op(e4,e3) = e0. [assumption]. op(e4,e4) = e3. [assumption]. op(e4,e5) = e1. [assumption]. op(e5,e0) = e5. [assumption]. op(e5,e1) = e3. [assumption]. op(e5,e2) = e4. [assumption]. op(e5,e3) = e1. [assumption]. op(e5,e4) = e2. [assumption]. op(e5,e5) = e0. [assumption]. unit = e0. [assumption]. inv(e0) = e0. [assumption]. inv(e1) = e1. [assumption]. inv(e2) = e2. [assumption]. inv(e3) = e4. [assumption]. inv(e4) = e3. [assumption]. inv(e5) = e5. [assumption]. op(inv(e5),e5) != unit. [assumption]. end_of_list. formulas(demodulators). end_of_list. ============================== PREDICATE ELIMINATION ================= No predicates eliminated. ============================== end predicate elimination ============= Term ordering decisions: Predicate symbol precedence: predicate_order([ = ]). Function symbol precedence: function_order([ e0, e1, e2, e3, e4, e5, unit, op, inv ]). After inverse_order: (no changes). Unfolding symbols: (none). Auto_inference settings: % set(paramodulation). % (positive equality literals) Auto_process settings: (no changes). kept: 1 e1 != e0. [assumption]. kept: 2 e2 != e0. [assumption]. kept: 3 e3 != e0. [assumption]. kept: 4 e4 != e0. [assumption]. kept: 5 e5 != e0. [assumption]. kept: 6 e2 != e1. [assumption]. kept: 7 e3 != e1. [assumption]. kept: 8 e4 != e1. [assumption]. kept: 9 e5 != e1. [assumption]. kept: 10 e3 != e2. [assumption]. kept: 11 e4 != e2. [assumption]. kept: 12 e5 != e2. [assumption]. kept: 13 e4 != e3. [assumption]. kept: 14 e5 != e3. [assumption]. kept: 15 e5 != e4. [assumption]. kept: 16 op(e0,e0) = e0. [assumption]. kept: 17 op(e0,e1) = e1. [assumption]. kept: 18 op(e0,e2) = e2. [assumption]. kept: 19 op(e0,e3) = e3. [assumption]. kept: 20 op(e0,e4) = e4. [assumption]. kept: 21 op(e0,e5) = e5. [assumption]. kept: 22 op(e1,e0) = e1. [assumption]. kept: 23 op(e1,e1) = e0. [assumption]. kept: 24 op(e1,e2) = e3. [assumption]. kept: 25 op(e1,e3) = e2. [assumption]. kept: 26 op(e1,e4) = e5. [assumption]. kept: 27 op(e1,e5) = e4. [assumption]. kept: 28 op(e2,e0) = e2. [assumption]. kept: 29 op(e2,e1) = e4. [assumption]. kept: 30 op(e2,e2) = e0. [assumption]. kept: 31 op(e2,e3) = e5. [assumption]. kept: 32 op(e2,e4) = e1. [assumption]. kept: 33 op(e2,e5) = e3. [assumption]. kept: 34 op(e3,e0) = e3. [assumption]. kept: 35 op(e3,e1) = e5. [assumption]. kept: 36 op(e3,e2) = e1. [assumption]. kept: 37 op(e3,e3) = e4. [assumption]. kept: 38 op(e3,e4) = e0. [assumption]. kept: 39 op(e3,e5) = e2. [assumption]. kept: 40 op(e4,e0) = e4. [assumption]. kept: 41 op(e4,e1) = e2. [assumption]. kept: 42 op(e4,e2) = e5. [assumption]. kept: 43 op(e4,e3) = e0. [assumption]. kept: 44 op(e4,e4) = e3. [assumption]. kept: 45 op(e4,e5) = e1. [assumption]. kept: 46 op(e5,e0) = e5. [assumption]. kept: 47 op(e5,e1) = e3. [assumption]. kept: 48 op(e5,e2) = e4. [assumption]. kept: 49 op(e5,e3) = e1. [assumption]. kept: 50 op(e5,e4) = e2. [assumption]. kept: 51 op(e5,e5) = e0. [assumption]. kept: 52 unit = e0. [assumption]. kept: 53 inv(e0) = e0. [assumption]. kept: 54 inv(e1) = e1. [assumption]. kept: 55 inv(e2) = e2. [assumption]. kept: 56 inv(e3) = e4. [assumption]. kept: 57 inv(e4) = e3. [assumption]. kept: 58 inv(e5) = e5. [assumption]. 59 op(inv(e5),e5) != unit. [assumption]. ============================== PROOF ================================= % Proof 1 at 0.00 (+ 0.00) seconds. % Length of proof is 5. % Level of proof is 1. % Maximum clause weight is 5. % Given clauses 0. 51 op(e5,e5) = e0. [assumption]. 52 unit = e0. [assumption]. 58 inv(e5) = e5. [assumption]. 59 op(inv(e5),e5) != unit. [assumption]. 60 $F. [copy(59),rewrite([58(2),51(3),52(2)]),xx(a)]. ============================== end of proof ========================== ============================== STATISTICS ============================ Given=0. Generated=59. Kept=58. proofs=1. Usable=0. Sos=0. Demods=43. Limbo=58, Disabled=59. Hints=0. Kept_by_rule=0, Deleted_by_rule=0. Forward_subsumed=0. Back_subsumed=0. Sos_limit_deleted=0. Sos_displaced=0. Sos_removed=0. New_demodulators=43 (0 lex), Back_demodulated=0. Back_unit_deleted=0. Demod_attempts=413. Demod_rewrites=3. Res_instance_prunes=0. Para_instance_prunes=0. Basic_paramod_prunes=0. Nonunit_fsub_feature_tests=0. Nonunit_bsub_feature_tests=0. Megabytes=3.43. User_CPU=0.00, System_CPU=0.00, Wall_clock=3. ============================== end of statistics ===================== ============================== end of search ========================= Exiting with 1 proof. Process 11476 exit (max_proofs) Wed Feb 25 09:32:29 2009 ============================== end of multisearch ==================== All 241 subproblems have been proved, so we are done. Total user_CPU=2.32, system_CPU=0.48, wall_clock=3. THEOREM PROVED Exiting. Process 11235 exit (max_proofs) Wed Feb 25 09:32:29 2009