TPTP Problem File: LAT070-1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : LAT070-1 : TPTP v9.0.0. Released v2.6.0.
% Domain : Lattice Theory (Ortholattices)
% Problem : Given single axiom OL-23A, prove associativity
% Version : [MRV03] (equality) axioms.
% English : Given a single axiom OL-23A for ortholattices (OL) in terms of
% the Sheffer Stroke, prove a Sheffer stroke form of associativity.
% Refs : [MRV03] McCune et al. (2003), Sheffer Stroke Bases for Ortholatt
% Source : [MRV03]
% Names : OL-23A-associativity [MRV03]
% Status : Unsatisfiable
% Rating : 0.73 v9.0.0, 0.77 v8.2.0, 0.71 v8.1.0, 0.70 v7.5.0, 0.83 v7.4.0, 0.91 v7.3.0, 0.79 v7.1.0, 0.78 v7.0.0, 0.84 v6.4.0, 0.95 v6.3.0, 0.94 v6.2.0, 0.93 v6.1.0, 0.88 v6.0.0, 0.90 v5.5.0, 0.89 v5.4.0, 0.93 v5.3.0, 0.92 v5.2.0, 0.93 v4.1.0, 0.91 v4.0.1, 0.93 v4.0.0, 0.92 v3.7.0, 0.89 v3.4.0, 0.88 v3.3.0, 0.93 v3.1.0, 1.00 v2.7.0, 0.91 v2.6.0
% Syntax : Number of clauses : 2 ( 2 unt; 0 nHn; 1 RR)
% Number of literals : 2 ( 2 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 1 ( 0 usr; 0 prp; 2-2 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 4 ( 1 sgn)
% SPC : CNF_UNS_RFO_PEQ_UEQ
% Comments :
%--------------------------------------------------------------------------
%----Single axiom OL-23A
cnf(ol_23A,axiom,
f(f(f(f(B,A),f(A,C)),D),f(A,f(f(A,f(f(B,B),B)),C))) = A ).
%----Denial of Sheffer stroke associativity
cnf(associativity,negated_conjecture,
f(a,f(f(b,c),f(b,c))) != f(c,f(f(b,a),f(b,a))) ).
%--------------------------------------------------------------------------