TPTP Problem File: GRP743-1.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : GRP743-1 : TPTP v9.0.0. Released v4.0.0.
% Domain : Group Theory (Quasigroups)
% Problem : Biassociative non-associative Steiner loop
% Version : Especial.
% English :
% Refs : [Sta08] Stanovsky (2008), Email to G. Sutcliffe
% Source : [Sta08]
% Names :
% Status : Satisfiable
% Rating : 0.86 v9.0.0, 0.89 v8.2.0, 0.80 v8.1.0, 0.75 v7.5.0, 0.50 v7.1.0, 0.67 v7.0.0, 0.33 v6.4.0, 0.50 v6.3.0, 0.33 v6.2.0, 0.83 v6.1.0, 0.80 v5.5.0, 1.00 v5.2.0, 0.67 v4.0.1, 1.00 v4.0.0
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 1 RR)
% Number of literals : 10 ( 10 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 1 ( 0 usr; 0 prp; 2-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% SPC : CNF_SAT_RFO_PEQ_UEQ
% Comments : Size 16
%------------------------------------------------------------------------------
cnf(c01,axiom,
mult(A,ld(A,B)) = B ).
cnf(c02,axiom,
ld(A,mult(A,B)) = B ).
cnf(c03,axiom,
mult(rd(A,B),B) = A ).
cnf(c04,axiom,
rd(mult(A,B),B) = A ).
cnf(c05,axiom,
mult(A,unit) = A ).
cnf(c06,axiom,
mult(unit,A) = A ).
cnf(c07,axiom,
mult(A,mult(A,B)) = B ).
cnf(c08,axiom,
mult(A,B) = mult(B,A) ).
cnf(c09,axiom,
mult(A,mult(mult(A,mult(B,C)),C)) = mult(mult(A,mult(mult(A,B),C)),C) ).
cnf(sos,axiom,
mult(mult(a,b),c) != mult(a,mult(b,c)) ).
%------------------------------------------------------------------------------