Debian Codegraph @

test/regress/cli/regress1/fmf/PUZ001+1.smt2

raw
1 ; COMMAND-LINE: --finite-model-find
2 ; EXPECT: unsat
3 ;%------------------------------------------------------------------------------
4 ;% File : PUZ001+1 : TPTP v5.4.0. Released v2.0.0.
5 ;% Domain : Puzzles
6 ;% Problem : Dreadbury Mansion
7 ;% Version : Especial.
8 ;% Theorem formulation : Reduced > Complete.
9 ;% English : Someone who lives in Dreadbury Mansion killed Aunt Agatha.
10 ;% Agatha, the butler, and Charles live in Dreadbury Mansion,
11 ;% and are the only people who live therein. A killer always
12 ;% hates his victim, and is never richer than his victim.
13 ;% Charles hates no one that Aunt Agatha hates. Agatha hates
14 ;% everyone except the butler. The butler hates everyone not
15 ;% richer than Aunt Agatha. The butler hates everyone Aunt
16 ;% Agatha hates. No one hates everyone. Agatha is not the
17 ;% butler. Therefore : Agatha killed herself.
18
19 ;% Refs : [Pel86] Pelletier (1986), Seventy-five Problems for Testing Au
20 ;% : [Hah94] Haehnle (1994), Email to G. Sutcliffe
21 ;% Source : [Hah94]
22 ;% Names : Pelletier 55 [Pel86]
23
24 ;% Status : Theorem
25 ;% Rating : 0.07 v5.3.0, 0.19 v5.2.0, 0.00 v5.0.0, 0.08 v4.1.0, 0.13 v4.0.0, 0.12 v3.7.0, 0.14 v3.5.0, 0.00 v3.4.0, 0.08 v3.3.0, 0.11 v3.2.0, 0.22 v3.1.0, 0.17 v2.7.0, 0.00 v2.5.0, 0.33 v2.4.0, 0.33 v2.2.1, 0.00 v2.1.0
26 ;% Syntax : Number of formulae : 14 ( 6 unit)
27 ;% Number of atoms : 24 ( 5 equality)
28 ;% Maximal formula depth : 5 ( 3 average)
29 ;% Number of connectives : 16 ( 6 ~; 2 |; 1 &)
30 ;% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
31 ;% ( 0 ~|; 0 ~&)
32 ;% Number of predicates : 5 ( 0 propositional; 1-2 arity)
33 ;% Number of functors : 3 ( 3 constant; 0-0 arity)
34 ;% Number of variables : 12 ( 0 sgn; 10 !; 2 ?)
35 ;% Maximal term depth : 1 ( 1 average)
36 ;% SPC : FOF_THM_RFO_SEQ
37
38 ;% Comments : Modified by Geoff Sutcliffe.
39 ;% : Also known as "Who killed Aunt Agatha"
40 ;%------------------------------------------------------------------------------
41 ;%----Problem axioms
42 (set-logic UF)
43 (set-info :status unsat)
44 (declare-sort sort__smt2 0)
45 ; functions
46 (declare-fun agatha__smt2_0 ( ) sort__smt2)
47 (declare-fun butler__smt2_0 ( ) sort__smt2)
48 (declare-fun charles__smt2_0 ( ) sort__smt2)
49 ; predicates
50 (declare-fun lives__smt2_1 ( sort__smt2 ) Bool)
51 (declare-fun killed__smt2_2 ( sort__smt2 sort__smt2 ) Bool)
52 (declare-fun hates__smt2_2 ( sort__smt2 sort__smt2 ) Bool)
53 (declare-fun richer__smt2_2 ( sort__smt2 sort__smt2 ) Bool)
54
55 ; pel55_1 axiom
56 (assert (exists ((?X sort__smt2))
57 (and (lives__smt2_1 ?X)
58 (killed__smt2_2 ?X agatha__smt2_0))))
59
60 ; pel55_2_1 axiom
61 (assert (lives__smt2_1 agatha__smt2_0))
62
63 ; pel55_2_2 axiom
64 (assert (lives__smt2_1 butler__smt2_0))
65
66 ; pel55_2_3 axiom
67 (assert (lives__smt2_1 charles__smt2_0))
68
69 ; pel55_3 axiom
70 (assert (forall ((?X sort__smt2))
71 (=> (lives__smt2_1 ?X)
72 (or (= ?X agatha__smt2_0)
73 (= ?X butler__smt2_0)
74 (= ?X charles__smt2_0)))))
75
76 ; pel55_4 axiom
77 (assert (forall ((?X sort__smt2) (?Y sort__smt2))
78 (=> (killed__smt2_2 ?X ?Y)
79 (hates__smt2_2 ?X ?Y))))
80
81 ; pel55_5 axiom
82 (assert (forall ((?X sort__smt2) (?Y sort__smt2))
83 (=> (killed__smt2_2 ?X ?Y)
84 (not (richer__smt2_2 ?X ?Y)))))
85
86 ; pel55_6 axiom
87 (assert (forall ((?X sort__smt2))
88 (=> (hates__smt2_2 agatha__smt2_0 ?X)
89 (not (hates__smt2_2 charles__smt2_0 ?X)))))
90
91 ; pel55_7 axiom
92 (assert (forall ((?X sort__smt2))
93 (=> (not (= ?X butler__smt2_0))
94 (hates__smt2_2 agatha__smt2_0 ?X))))
95
96 ; pel55_8 axiom
97 (assert (forall ((?X sort__smt2))
98 (=> (not (richer__smt2_2 ?X agatha__smt2_0))
99 (hates__smt2_2 butler__smt2_0 ?X))))
100
101 ; pel55_9 axiom
102 (assert (forall ((?X sort__smt2))
103 (=> (hates__smt2_2 agatha__smt2_0 ?X)
104 (hates__smt2_2 butler__smt2_0 ?X))))
105
106 ; pel55_10 axiom
107 (assert (forall ((?X sort__smt2))
108 (exists ((?Y sort__smt2)) (not (hates__smt2_2 ?X ?Y)))))
109
110 ; pel55_11 axiom
111 (assert (not (= agatha__smt2_0 butler__smt2_0)))
112
113 ;----This is the conjecture with negated conjecture
114 ; pel55 conjecture
115 (assert (not (killed__smt2_2 agatha__smt2_0 agatha__smt2_0)))
116
117
118 (check-sat)