----- Otter 3.0.4, August 1995 -----
The job was started by brings on hopfield.phil.rpi.edu, Thu May 27 16:17:51 1999
The command was "otter".

set(auto).
   dependent: set(process_input).
   dependent: clear(print_kept).
   dependent: clear(print_new_demod).
   dependent: clear(print_back_demod).
   dependent: clear(print_back_sub).
   dependent: set(control_memory).
   dependent: assign(max_mem, 12000).
   dependent: assign(pick_given_ratio, 4).
   dependent: assign(stats_level, 1).
   dependent: assign(max_seconds, 10800).

formula_list(usable).
exists x (Dog(x)&Owns(ajack,x)).
all x ((exists y (Dog(y)&Owns(x,y)))->AnimalLover(x)).
all x (AnimalLover(x)-> (all y (Animal(y)-> -Kills(x,y)))).
Kills(ajack,atuna)|Kills(acuriosity,atuna).
Cat(atuna).
all x (Cat(x)->Animal(x)).
-Kills(acuriosity,atuna).
end_of_list.

-------> usable clausifies to:

list(usable).
0 [] Dog($c1).
0 [] Owns(ajack,$c1).
0 [] -Dog(y)| -Owns(x,y)|AnimalLover(x).
0 [] -AnimalLover(x)| -Animal(y)| -Kills(x,y).
0 [] Kills(ajack,atuna)|Kills(acuriosity,atuna).
0 [] Cat(atuna).
0 [] -Cat(x)|Animal(x).
0 [] -Kills(acuriosity,atuna).
end_of_list.

SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.

This is a non-Horn set without equality.  The strategy will
be ordered hyper_res, unit deletion, and factoring, with
satellites in sos with and nuclei in usable.

   dependent: set(hyper_res).
   dependent: set(factor).
   dependent: set(unit_deletion).

------------> process usable:
** KEPT (pick-wt=7): 1 [] -Dog(x)| -Owns(y,x)|AnimalLover(y).
** KEPT (pick-wt=7): 2 [] -AnimalLover(x)| -Animal(y)| -Kills(x,y).
** KEPT (pick-wt=4): 3 [] -Cat(x)|Animal(x).
** KEPT (pick-wt=3): 4 [] -Kills(acuriosity,atuna).

------------> process sos:
** KEPT (pick-wt=2): 5 [] Dog($c1).
** KEPT (pick-wt=3): 6 [] Owns(ajack,$c1).
** KEPT (pick-wt=3): 8 [copy,7,unit_del,4] Kills(ajack,atuna).
** KEPT (pick-wt=2): 9 [] Cat(atuna).

======= end of input processing =======

=========== start of search ===========

given clause #1: (wt=2) 5 [] Dog($c1).

given clause #2: (wt=2) 9 [] Cat(atuna).

given clause #3: (wt=2) 10 [hyper,9,3] Animal(atuna).

given clause #4: (wt=3) 6 [] Owns(ajack,$c1).

given clause #5: (wt=2) 11 [hyper,6,1,5] AnimalLover(ajack).

given clause #6: (wt=3) 8 [copy,7,unit_del,4] Kills(ajack,atuna).

-----> EMPTY CLAUSE at   0.07 sec ----> 12 [hyper,8,2,11,10] $F.

Length of proof is 3.  Level of proof is 1.

---------------- PROOF ----------------

1 [] -Dog(x)| -Owns(y,x)|AnimalLover(y).
2 [] -AnimalLover(x)| -Animal(y)| -Kills(x,y).
3 [] -Cat(x)|Animal(x).
4 [] -Kills(acuriosity,atuna).
5 [] Dog($c1).
6 [] Owns(ajack,$c1).
7 [] Kills(ajack,atuna)|Kills(acuriosity,atuna).
8 [copy,7,unit_del,4] Kills(ajack,atuna).
9 [] Cat(atuna).
10 [hyper,9,3] Animal(atuna).
11 [hyper,6,1,5] AnimalLover(ajack).
12 [hyper,8,2,11,10] $F.

------------ end of proof -------------


Search stopped by max_proofs option.

============ end of search ============

-------------- statistics -------------
clauses given                  6
clauses generated              3
clauses kept                  10
clauses forward subsumed       0
clauses back subsumed          0
Kbytes malloced               63

----------- times (seconds) -----------
user CPU time          0.07          (0 hr, 0 min, 0 sec)
system CPU time        0.05          (0 hr, 0 min, 0 sec)
wall-clock time        0             (0 hr, 0 min, 0 sec)
hyper_res time         0.00
for_sub time           0.00
back_sub time          0.00
conflict time          0.00
demod time             0.00

The job finished        Thu May 27 16:17:51 1999