TPTP Problem File: PUZ056-2.015.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : PUZ056-2.015 : TPTP v8.2.0. Released v3.5.0.
% Domain : Puzzles
% Problem : Towers of Hanoi k=15
% Version : Especial.
% English : Each instance encodes Tower of Hanoi with n discs as a
% reachability problem.
% Refs : [NV07] Navarro (2007), Email to Geoff Sutcliffe
% Source : [NV07]
% Names : hanoi-k15 [NV07a]
% Status : Unsatisfiable
% Rating : 0.67 v8.1.0, 1.00 v7.3.0, 0.90 v7.2.0, 0.89 v7.1.0, 1.00 v6.2.0, 0.88 v6.0.0, 0.75 v5.5.0, 0.60 v5.4.0, 1.00 v3.5.0
% Syntax : Number of clauses : 26 ( 11 unt; 0 nHn; 25 RR)
% Number of literals : 251 ( 0 equ; 229 neg)
% Maximal clause size : 30 ( 9 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 2 usr; 0 prp; 2-15 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 240 ( 2 sgn)
% SPC : CNF_UNS_EPR_NEQ_HRN
% Comments : k >= 13 not solved by any prover in less than 1 hr. (2007)
%------------------------------------------------------------------------------
cnf(rule1,axiom,
( ~ p(I,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14)
| p(J,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14) ) ).
cnf(rule2,axiom,
( ~ p(T0,I,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14)
| ~ neq(T0,I)
| ~ neq(T0,J)
| p(T0,J,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14) ) ).
cnf(rule3,axiom,
( ~ p(T0,T1,I,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14)
| ~ neq(T0,I)
| ~ neq(T0,J)
| ~ neq(T1,I)
| ~ neq(T1,J)
| p(T0,T1,J,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14) ) ).
cnf(rule4,axiom,
( ~ p(T0,T1,T2,I,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14)
| ~ neq(T0,I)
| ~ neq(T0,J)
| ~ neq(T1,I)
| ~ neq(T1,J)
| ~ neq(T2,I)
| ~ neq(T2,J)
| p(T0,T1,T2,J,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14) ) ).
cnf(rule5,axiom,
( ~ p(T0,T1,T2,T3,I,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14)
| ~ neq(T0,I)
| ~ neq(T0,J)
| ~ neq(T1,I)
| ~ neq(T1,J)
| ~ neq(T2,I)
| ~ neq(T2,J)
| ~ neq(T3,I)
| ~ neq(T3,J)
| p(T0,T1,T2,T3,J,T5,T6,T7,T8,T9,T10,T11,T12,T13,T14) ) ).
cnf(rule6,axiom,
( ~ p(T0,T1,T2,T3,T4,I,T6,T7,T8,T9,T10,T11,T12,T13,T14)
| ~ neq(T0,I)
| ~ neq(T0,J)
| ~ neq(T1,I)
| ~ neq(T1,J)
| ~ neq(T2,I)
| ~ neq(T2,J)
| ~ neq(T3,I)
| ~ neq(T3,J)
| ~ neq(T4,I)
| ~ neq(T4,J)
| p(T0,T1,T2,T3,T4,J,T6,T7,T8,T9,T10,T11,T12,T13,T14) ) ).
cnf(rule7,axiom,
( ~ p(T0,T1,T2,T3,T4,T5,I,T7,T8,T9,T10,T11,T12,T13,T14)
| ~ neq(T0,I)
| ~ neq(T0,J)
| ~ neq(T1,I)
| ~ neq(T1,J)
| ~ neq(T2,I)
| ~ neq(T2,J)
| ~ neq(T3,I)
| ~ neq(T3,J)
| ~ neq(T4,I)
| ~ neq(T4,J)
| ~ neq(T5,I)
| ~ neq(T5,J)
| p(T0,T1,T2,T3,T4,T5,J,T7,T8,T9,T10,T11,T12,T13,T14) ) ).
cnf(rule8,axiom,
( ~ p(T0,T1,T2,T3,T4,T5,T6,I,T8,T9,T10,T11,T12,T13,T14)
| ~ neq(T0,I)
| ~ neq(T0,J)
| ~ neq(T1,I)
| ~ neq(T1,J)
| ~ neq(T2,I)
| ~ neq(T2,J)
| ~ neq(T3,I)
| ~ neq(T3,J)
| ~ neq(T4,I)
| ~ neq(T4,J)
| ~ neq(T5,I)
| ~ neq(T5,J)
| ~ neq(T6,I)
| ~ neq(T6,J)
| p(T0,T1,T2,T3,T4,T5,T6,J,T8,T9,T10,T11,T12,T13,T14) ) ).
cnf(rule9,axiom,
( ~ p(T0,T1,T2,T3,T4,T5,T6,T7,I,T9,T10,T11,T12,T13,T14)
| ~ neq(T0,I)
| ~ neq(T0,J)
| ~ neq(T1,I)
| ~ neq(T1,J)
| ~ neq(T2,I)
| ~ neq(T2,J)
| ~ neq(T3,I)
| ~ neq(T3,J)
| ~ neq(T4,I)
| ~ neq(T4,J)
| ~ neq(T5,I)
| ~ neq(T5,J)
| ~ neq(T6,I)
| ~ neq(T6,J)
| ~ neq(T7,I)
| ~ neq(T7,J)
| p(T0,T1,T2,T3,T4,T5,T6,T7,J,T9,T10,T11,T12,T13,T14) ) ).
cnf(rule10,axiom,
( ~ p(T0,T1,T2,T3,T4,T5,T6,T7,T8,I,T10,T11,T12,T13,T14)
| ~ neq(T0,I)
| ~ neq(T0,J)
| ~ neq(T1,I)
| ~ neq(T1,J)
| ~ neq(T2,I)
| ~ neq(T2,J)
| ~ neq(T3,I)
| ~ neq(T3,J)
| ~ neq(T4,I)
| ~ neq(T4,J)
| ~ neq(T5,I)
| ~ neq(T5,J)
| ~ neq(T6,I)
| ~ neq(T6,J)
| ~ neq(T7,I)
| ~ neq(T7,J)
| ~ neq(T8,I)
| ~ neq(T8,J)
| p(T0,T1,T2,T3,T4,T5,T6,T7,T8,J,T10,T11,T12,T13,T14) ) ).
cnf(rule11,axiom,
( ~ p(T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,I,T11,T12,T13,T14)
| ~ neq(T0,I)
| ~ neq(T0,J)
| ~ neq(T1,I)
| ~ neq(T1,J)
| ~ neq(T2,I)
| ~ neq(T2,J)
| ~ neq(T3,I)
| ~ neq(T3,J)
| ~ neq(T4,I)
| ~ neq(T4,J)
| ~ neq(T5,I)
| ~ neq(T5,J)
| ~ neq(T6,I)
| ~ neq(T6,J)
| ~ neq(T7,I)
| ~ neq(T7,J)
| ~ neq(T8,I)
| ~ neq(T8,J)
| ~ neq(T9,I)
| ~ neq(T9,J)
| p(T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,J,T11,T12,T13,T14) ) ).
cnf(rule12,axiom,
( ~ p(T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,I,T12,T13,T14)
| ~ neq(T0,I)
| ~ neq(T0,J)
| ~ neq(T1,I)
| ~ neq(T1,J)
| ~ neq(T2,I)
| ~ neq(T2,J)
| ~ neq(T3,I)
| ~ neq(T3,J)
| ~ neq(T4,I)
| ~ neq(T4,J)
| ~ neq(T5,I)
| ~ neq(T5,J)
| ~ neq(T6,I)
| ~ neq(T6,J)
| ~ neq(T7,I)
| ~ neq(T7,J)
| ~ neq(T8,I)
| ~ neq(T8,J)
| ~ neq(T9,I)
| ~ neq(T9,J)
| ~ neq(T10,I)
| ~ neq(T10,J)
| p(T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,J,T12,T13,T14) ) ).
cnf(rule13,axiom,
( ~ p(T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,I,T13,T14)
| ~ neq(T0,I)
| ~ neq(T0,J)
| ~ neq(T1,I)
| ~ neq(T1,J)
| ~ neq(T2,I)
| ~ neq(T2,J)
| ~ neq(T3,I)
| ~ neq(T3,J)
| ~ neq(T4,I)
| ~ neq(T4,J)
| ~ neq(T5,I)
| ~ neq(T5,J)
| ~ neq(T6,I)
| ~ neq(T6,J)
| ~ neq(T7,I)
| ~ neq(T7,J)
| ~ neq(T8,I)
| ~ neq(T8,J)
| ~ neq(T9,I)
| ~ neq(T9,J)
| ~ neq(T10,I)
| ~ neq(T10,J)
| ~ neq(T11,I)
| ~ neq(T11,J)
| p(T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,J,T13,T14) ) ).
cnf(rule14,axiom,
( ~ p(T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,I,T14)
| ~ neq(T0,I)
| ~ neq(T0,J)
| ~ neq(T1,I)
| ~ neq(T1,J)
| ~ neq(T2,I)
| ~ neq(T2,J)
| ~ neq(T3,I)
| ~ neq(T3,J)
| ~ neq(T4,I)
| ~ neq(T4,J)
| ~ neq(T5,I)
| ~ neq(T5,J)
| ~ neq(T6,I)
| ~ neq(T6,J)
| ~ neq(T7,I)
| ~ neq(T7,J)
| ~ neq(T8,I)
| ~ neq(T8,J)
| ~ neq(T9,I)
| ~ neq(T9,J)
| ~ neq(T10,I)
| ~ neq(T10,J)
| ~ neq(T11,I)
| ~ neq(T11,J)
| ~ neq(T12,I)
| ~ neq(T12,J)
| p(T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,J,T14) ) ).
cnf(rule15,axiom,
( ~ p(T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,I)
| ~ neq(T0,I)
| ~ neq(T0,J)
| ~ neq(T1,I)
| ~ neq(T1,J)
| ~ neq(T2,I)
| ~ neq(T2,J)
| ~ neq(T3,I)
| ~ neq(T3,J)
| ~ neq(T4,I)
| ~ neq(T4,J)
| ~ neq(T5,I)
| ~ neq(T5,J)
| ~ neq(T6,I)
| ~ neq(T6,J)
| ~ neq(T7,I)
| ~ neq(T7,J)
| ~ neq(T8,I)
| ~ neq(T8,J)
| ~ neq(T9,I)
| ~ neq(T9,J)
| ~ neq(T10,I)
| ~ neq(T10,J)
| ~ neq(T11,I)
| ~ neq(T11,J)
| ~ neq(T12,I)
| ~ neq(T12,J)
| ~ neq(T13,I)
| ~ neq(T13,J)
| p(T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,T10,T11,T12,T13,J) ) ).
cnf(neq1,axiom,
~ neq(s0,s0) ).
cnf(neq2,axiom,
neq(s0,s1) ).
cnf(neq3,axiom,
neq(s0,s2) ).
cnf(neq4,axiom,
neq(s1,s0) ).
cnf(neq5,axiom,
~ neq(s1,s1) ).
cnf(neq6,axiom,
neq(s1,s2) ).
cnf(neq7,axiom,
neq(s2,s0) ).
cnf(neq8,axiom,
neq(s2,s1) ).
cnf(neq9,axiom,
~ neq(s2,s2) ).
cnf(init,axiom,
p(s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0,s0) ).
cnf(goal,negated_conjecture,
~ p(s2,s2,s2,s2,s2,s2,s2,s2,s2,s2,s2,s2,s2,s2,s2) ).
%------------------------------------------------------------------------------