%------------------------------------------------------------------------------
% File     : HWV052-1.001.001 : TPTP v8.2.0. Released v4.1.0.
% Domain   : Hardware Verification
% Problem  : Faulty channel 1 1
% Version  : Especial.
% English  : The problem of sending N bits over a faulty channel that can 
%            mutilate any one bit. We can use K extra bits to help us do this.
%            Satisfiable means that it is possible, unsatisfiable means that 
%            it is not possible.

% Refs     : [Cla10] Claessen (2010), Email to Geoff Sutcliffe
% Source   : [Cla10]
% Names    : fault_1_1 [Cla10]

% Status   : Unsatisfiable
% Rating   : 0.13 v8.2.0, 0.06 v8.1.0, 0.05 v7.5.0, 0.06 v7.4.0, 0.12 v7.3.0, 0.08 v7.2.0, 0.00 v7.0.0, 0.15 v6.4.0, 0.14 v6.3.0, 0.20 v6.2.0, 0.30 v6.1.0, 0.18 v6.0.0, 0.00 v5.4.0, 0.11 v5.3.0, 0.20 v5.2.0, 0.25 v5.1.0, 0.33 v5.0.0, 0.20 v4.1.0
% Syntax   : Number of clauses     :    5 (   4 unt;   1 nHn;   1 RR)
%            Number of literals    :    6 (   6 equ;   1 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    1 (   0 usr;   0 prp; 2-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :    5 (   0 sgn)
% SPC      : CNF_UNS_RFO_PEQ_NUE

% Comments : 
%------------------------------------------------------------------------------
cnf(bit_domain,axiom,
    ( X = o
    | X = i ) ).

cnf(bit_inverse,axiom,
    inv(X) != X ).

cnf(unpack1,axiom,
    unpack1(X1,pack1(X1)) = X1 ).

cnf(unpack1_01,axiom,
    unpack1(inv(X1),pack1(X1)) = X1 ).

cnf(unpack1_02,axiom,
    unpack1(X1,inv(pack1(X1))) = X1 ).

%------------------------------------------------------------------------------