%--------------------------------------------------------------------------
% File     : RNG025-1 : TPTP v9.0.0. Released v1.0.0.
% Domain   : Ring Theory (Alternative)
% Problem  : Middle or Flexible Law
% Version  : [AH90] (equality) axioms.
% English  :

% Refs     : [AH90]  Anantharaman & Hsiang (1990), Automated Proofs of the
% Source   : [AH90]
% Names    : PROOF I [AH90]

% Status   : Unsatisfiable
% Rating   : 0.47 v9.0.0, 0.53 v8.2.0, 0.62 v8.1.0, 0.63 v7.5.0, 0.71 v7.4.0, 0.76 v7.3.0, 0.85 v7.2.0, 0.83 v7.1.0, 0.73 v7.0.0, 0.77 v6.4.0, 0.79 v6.3.0, 0.70 v6.1.0, 0.82 v6.0.0, 0.71 v5.5.0, 0.75 v5.4.0, 0.78 v5.3.0, 0.80 v5.2.0, 0.75 v5.1.0, 0.78 v5.0.0, 0.80 v4.1.0, 0.67 v4.0.1, 0.75 v4.0.0, 0.57 v3.7.0, 0.29 v3.4.0, 0.17 v3.3.0, 0.33 v3.2.0, 0.44 v3.1.0, 0.40 v2.7.0, 0.50 v2.6.0, 0.33 v2.5.0, 0.50 v2.4.0, 0.50 v2.3.0, 0.75 v2.2.1, 1.00 v2.0.0
% Syntax   : Number of clauses     :   18 (  16 unt;   0 nHn;   4 RR)
%            Number of literals    :   20 (  20 equ;   3 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    1 (   0 usr;   0 prp; 2-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   32 (   2 sgn)
% SPC      : CNF_UNS_RFO_PEQ_NUE

% Comments :
%--------------------------------------------------------------------------
%----Include Ring theory (equality) axioms
include('Axioms/RNG004-0.ax').
%--------------------------------------------------------------------------
cnf(prove_middle_law,negated_conjecture,
    multiply(multiply(cy,cx),cy) != multiply(cy,multiply(cx,cy)) ).

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