TPTP Problem File: LCL645+1.001.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : LCL645+1.001 : TPTP v9.0.0. Released v4.0.0.
% Domain : Logic Calculi (Modal Logic)
% Problem : In K, L+ is not provable with instances of L, size 1
% Version : Especial.
% English :
% Refs : [BHS00] Balsiger et al. (2000), A Benchmark Method for the Pro
% : [Kam08] Kaminski (2008), Email to G. Sutcliffe
% Source : [Kam08]
% Names : k_lin_n [BHS00]
% Status : CounterSatisfiable
% Rating : 0.00 v4.0.0
% Syntax : Number of formulae : 1 ( 0 unt; 0 def)
% Number of atoms : 8 ( 0 equ)
% Maximal formula atoms : 8 ( 8 avg)
% Number of connectives : 15 ( 8 ~; 7 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 12 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 2 ( 2 usr; 0 prp; 1-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 5 ( 4 !; 1 ?)
% SPC : FOF_CSA_EPR_NEQ
% Comments : A naive relational encoding of the modal logic problem into
% first-order logic.
%------------------------------------------------------------------------------
fof(main,conjecture,
~ ? [X] :
~ ( ! [Y] :
( ~ r1(X,Y)
| p1(Y)
| ~ ! [X] :
( ~ r1(Y,X)
| p1(X) ) )
| ! [Y] :
( ~ r1(X,Y)
| p1(Y)
| ~ ! [X] :
( ~ r1(Y,X)
| p1(X) ) ) ) ).
%------------------------------------------------------------------------------