TPTP Problem File: NLP011+1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : NLP011+1 : TPTP v8.2.0. Released v2.4.0.
% Domain : Natural Language Processing
% Problem : "The old dirty white Chevy" problem 11
% Version : [Bos00] axioms.
% English : A problem generated by the DORIS [Bos00] system when parsing
% the statement "The old dirty white Chevy barrels down a lonely
% street in Hollywood".
% Refs : [Bos00] Bos (2000), DORIS: Discourse Oriented Representation an
% [Bau99] Baumgartner (1999), FTP'2000 - Problem Sets
% Source : [Bau99]
% Names :
% Status : Theorem
% Rating : 0.00 v5.5.0, 0.11 v5.3.0, 0.36 v5.2.0, 0.25 v5.0.0, 0.00 v4.1.0, 0.39 v4.0.0, 0.42 v3.7.0, 0.14 v3.5.0, 0.11 v3.4.0, 0.17 v3.3.0, 0.22 v3.2.0, 0.33 v3.1.0, 0.67 v2.7.0, 0.33 v2.6.0, 0.00 v2.4.0
% Syntax : Number of formulae : 1 ( 0 unt; 0 def)
% Number of atoms : 124 ( 12 equ)
% Maximal formula atoms : 124 ( 124 avg)
% Number of connectives : 127 ( 4 ~; 0 |; 121 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 43 ( 43 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 21 ( 20 usr; 0 prp; 1-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 40 ( 0 !; 40 ?)
% SPC : FOF_THM_EPR_SEQ
% Comments :
%--------------------------------------------------------------------------
fof(co1,conjecture,
( ( ? [U,V,W,X,Y,Z,X1,X2,X3,X4] :
( seat(U)
& furniture(U)
& front(U)
& hollywood(V)
& city(V)
& event(W)
& street(X)
& way(X)
& lonely(X)
& chevy(Y)
& car(Y)
& white(Y)
& dirty(Y)
& old(Y)
& barrel(W,Y)
& down(W,X)
& in(W,V)
& seat(X2)
& furniture(X2)
& front(X2)
& Z != X1
& fellow(Z)
& man(Z)
& young(Z)
& fellow(X1)
& man(X1)
& young(X1)
& Z = X3
& in(X3,X2)
& X1 = X4
& in(X4,U) )
=> ? [X5,X6,X7,X8,X9,X10,X11,X12,X13,X14] :
( seat(X5)
& furniture(X5)
& front(X5)
& hollywood(X6)
& city(X6)
& event(X7)
& street(X8)
& way(X8)
& lonely(X8)
& chevy(X9)
& car(X9)
& white(X9)
& dirty(X9)
& old(X9)
& barrel(X7,X9)
& down(X7,X8)
& in(X7,X6)
& seat(X12)
& furniture(X12)
& front(X12)
& X10 != X11
& fellow(X10)
& man(X10)
& young(X10)
& fellow(X11)
& man(X11)
& young(X11)
& X10 = X13
& in(X13,X5)
& X11 = X14
& in(X14,X12) ) )
& ( ? [X15,X16,X17,X18,X19,X20,X21,X22,X23,X24] :
( seat(X15)
& furniture(X15)
& front(X15)
& hollywood(X16)
& city(X16)
& event(X17)
& street(X18)
& way(X18)
& lonely(X18)
& chevy(X19)
& car(X19)
& white(X19)
& dirty(X19)
& old(X19)
& barrel(X17,X19)
& down(X17,X18)
& in(X17,X16)
& seat(X22)
& furniture(X22)
& front(X22)
& X20 != X21
& fellow(X20)
& man(X20)
& young(X20)
& fellow(X21)
& man(X21)
& young(X21)
& X20 = X23
& in(X23,X15)
& X21 = X24
& in(X24,X22) )
=> ? [X25,X26,X27,X28,X29,X30,X31,X32,X33,X34] :
( seat(X25)
& furniture(X25)
& front(X25)
& hollywood(X26)
& city(X26)
& event(X27)
& street(X28)
& way(X28)
& lonely(X28)
& chevy(X29)
& car(X29)
& white(X29)
& dirty(X29)
& old(X29)
& barrel(X27,X29)
& down(X27,X28)
& in(X27,X26)
& seat(X32)
& furniture(X32)
& front(X32)
& X30 != X31
& fellow(X30)
& man(X30)
& young(X30)
& fellow(X31)
& man(X31)
& young(X31)
& X30 = X33
& in(X33,X32)
& X31 = X34
& in(X34,X25) ) ) ) ).
%--------------------------------------------------------------------------