TPTP Problem File: LCL662+1.020.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : LCL662+1.020 : TPTP v9.0.0. Released v4.0.0.
% Domain : Logic Calculi (Modal Logic)
% Problem : In KT, in backward search find a way through box and dia, size 20
% 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 : kt_md_p [BHS00]
% Status : Theorem
% Rating : 0.93 v9.0.0, 0.94 v8.2.0, 0.93 v7.5.0, 0.95 v7.4.0, 0.94 v7.3.0, 0.86 v7.2.0, 0.83 v7.1.0, 0.75 v7.0.0, 1.00 v6.3.0, 0.92 v6.2.0, 0.91 v6.1.0, 1.00 v5.2.0, 0.93 v5.0.0, 0.95 v4.1.0, 0.94 v4.0.1, 0.95 v4.0.0
% Syntax : Number of formulae : 2 ( 1 unt; 0 def)
% Number of atoms : 11954 ( 0 equ)
% Maximal formula atoms : 11953 (5977 avg)
% Number of connectives : 25249 (13297 ~;11895 |; 57 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 813 ( 408 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 3 usr; 0 prp; 1-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 11839 (11838 !; 1 ?)
% SPC : FOF_THM_RFO_NEQ
% Comments : A naive relational encoding of the modal logic problem into
% first-order logic.
%------------------------------------------------------------------------------
fof(reflexivity,axiom,
! [X] : r1(X,X) ).