TPTP Problem File: NLP266_4.p
View Solutions
- Solve Problem
%------------------------------------------------------------------------------
% File : NLP266_4 : TPTP v8.2.0. Released v8.2.0.
% Domain : Natural Language Processing
% Problem : Generation of abstract instructions: enter a number in a box
% Version : [QMLTP] axioms.
% English :
% Refs : [Sto00] Stone (2000), Towards a Computational Account of Knowl
% : [RO12] Raths & Otten (2012), The QMLTP Problem Library for Fi
% Source : [QMLTP]
% Names : APM003+1 [QMLTP]
% Status : Theorem
% Rating : 0.00 v8.2.0
% Syntax : Number of formulae : 20 ( 3 unt; 12 typ; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 13 ( 4 avg)
% Number of connectives : 31 ( 0 ~; 0 |; 14 &)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 8 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 22 ( 8 >; 14 *; 0 +; 0 <<)
% Number of predicates : 8 ( 8 usr; 0 prp; 2-4 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 28 (; 20 !; 8 ?; 28 :)
% SPC : TF0_THM_NEQ_NAR
% Comments : Generated by embedproblem, version 1.7.14, rigid constant,
% modal_system_S4, TFF embedding.
%------------------------------------------------------------------------------
tff('$ki_world_type',type,
'$ki_world': $tType ).
tff('$ki_local_world_decl',type,
'$ki_local_world': '$ki_world' ).
tff('$ki_accessible_decl',type,
'$ki_accessible': ( '$ki_world' * '$ki_world' ) > $o ).
tff(mrel_reflexive,axiom,
! [W: '$ki_world'] : '$ki_accessible'(W,W) ).
tff(mrel_transitive,axiom,
! [W: '$ki_world',V: '$ki_world',U: '$ki_world'] :
( ( '$ki_accessible'(W,V)
& '$ki_accessible'(V,U) )
=> '$ki_accessible'(W,U) ) ).
tff(u_decl,type,
u: $i ).
tff(one_decl,type,
one: $i ).
tff(number_decl,type,
number: ( '$ki_world' * $i * $i ) > $o ).
tff(string_decl,type,
string: ( '$ki_world' * $i ) > $o ).
tff(in_decl,type,
in: ( '$ki_world' * $i * $i * $i ) > $o ).
tff(do_decl,type,
do: ( '$ki_world' * $i * $i * $i ) > $o ).
tff(entry_box_decl,type,
entry_box: ( '$ki_world' * $i ) > $o ).
tff(userid_decl,type,
userid: ( '$ki_world' * $i * $i ) > $o ).
tff('$ki_exists_in_world_$i_decl',type,
'$ki_exists_in_world_$i': ( '$ki_world' * $i ) > $o ).
tff('$ki_exists_in_world_$i_const',axiom,
! [W: '$ki_world',X: $i] : '$ki_exists_in_world_$i'(W,X) ).
tff('$ki_exists_in_world_$i_nonempty',axiom,
! [W: '$ki_world'] :
? [X: $i] : '$ki_exists_in_world_$i'(W,X) ).
tff(ax1,axiom,
! [W: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',W)
=> ? [I: $i] :
( '$ki_exists_in_world_$i'(W,I)
& ! [W0: '$ki_world'] :
( '$ki_accessible'(W,W0)
=> ( userid(W0,u,I)
& string(W0,I) ) ) ) ) ).
tff(ax2,axiom,
? [B: $i] :
( '$ki_exists_in_world_$i'('$ki_local_world',B)
& ! [W: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',W)
=> ( entry_box(W,B)
& number(W,B,one) ) ) ) ).
tff(ax3,axiom,
! [W: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',W)
=> ! [S: $i] :
( '$ki_exists_in_world_$i'(W,S)
=> ! [I: $i] :
( '$ki_exists_in_world_$i'(W,I)
=> ! [B: $i] :
( '$ki_exists_in_world_$i'(W,B)
=> ( ( string(W,I)
& entry_box(W,B) )
=> ? [A: $i] :
( '$ki_exists_in_world_$i'(W,A)
& ! [W0: '$ki_world'] :
( '$ki_accessible'(W,W0)
=> ! [S2: $i] :
( '$ki_exists_in_world_$i'(W0,S2)
=> ( do(W0,S,A,S2)
=> in(W0,I,B,S2) ) ) ) ) ) ) ) ) ) ).
tff(verify,conjecture,
! [W: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',W)
=> ? [I: $i] :
( '$ki_exists_in_world_$i'(W,I)
& ? [B: $i] :
( '$ki_exists_in_world_$i'(W,B)
& ? [A: $i] :
( '$ki_exists_in_world_$i'(W,A)
& ? [S: $i] :
( '$ki_exists_in_world_$i'(W,S)
& ! [W0: '$ki_world'] :
( '$ki_accessible'(W,W0)
=> ( userid(W0,u,I)
& entry_box(W0,B)
& number(W0,B,one) ) )
& ! [W0: '$ki_world'] :
( '$ki_accessible'(W,W0)
=> ! [S2: $i] :
( '$ki_exists_in_world_$i'(W0,S2)
=> ( do(W0,S,A,S2)
=> in(W0,I,B,S2) ) ) ) ) ) ) ) ) ).
%------------------------------------------------------------------------------