
hipP version 0.1.14 (i686-pc-linux-gnu, threaded mode)
(built on i686-pc-linux-gnu on Thu Nov 30 10:53:25 CET 2006)
For academic or scientific (non-commercial) use only.
Copyright K.U.Leuven, Department of Computer Science.

==================================================================
ACE-ilProlog 1.2.20 for scientific (non-commercial) use only.
Copyright K.U.Leuven, Department of Computer Science.
Contact: http://www.cs.kuleuven.be/~dtai/ACE.
==================================================================

Now loading files for application siblings-episodes 
**Initialising settings** 
  loading /home/tomas/sayphi/domains/matching-bw/roller/siblings-episodes/siblings-episodes.s ...  
**Initialising language** 
**Initialising knowledge** 
**Loading kb file /home/tomas/sayphi/domains/matching-bw/roller/siblings-episodes/siblings-episodes.kb ** 
  -> load method =  key 
**No bg file available** 
  -> 430 examples have been processed 

ace-siblings-episodes> tilde
Loading Tilde
Loading Prediction for ACE
Initializing Query Transformation Library
Initializing C++ Packs Library
Storing attribute: gen(selected(A,B,C),C)
Storing all attributes: .
HRType:  esh_gainratio 
TILDE
Discretization busy...
Right subtree optimization disabled. 
Preprocessing constant generators. 
Sampling check:  430  examples, max is  1000 
#Ex=430, #Q=32

Best test: selected(A,B,C),helpful_stack_pos_neg(A,B,D,E,F)
Sampling check:  412  examples, max is  1000 
#Ex=412, #Q=32

Best test: selected(A,B,C),helpful_stack_neg_pos(A,B,D,E,F)
Sampling check:  397  examples, max is  1000 
#Ex=397, #Q=32

Best test: selected(A,B,C),helpful_stack_neg_neg(A,B,D,E,F)
Sampling check:  268  examples, max is  1000 
#Ex=268, #Q=32

Best test: selected(A,B,C),helpful_stack_pos_pos(A,B,D,E,F)
Sampling check:  190  examples, max is  1000 
#Ex=190, #Q=32

Best test: selected(A,B,C),helpful_unstack(A,B,D,E,F)
Leaf: [pickup] - 44.0
Sampling check:  146  examples, max is  1000 
#Ex=146, #Q=191

Best test: (selected(A,B,C),helpful_unstack(A,B,D,E,F)),static_fact_hand_negative(B,D)
Sampling check:  24  examples, max is  1000 
#Ex=24, #Q=191

Best test: (selected(A,B,C),helpful_unstack(A,B,D,E,F)),helpful_pickup(A,B,D,G)
Leaf: [unstack] - 6.0
Sampling check:  18  examples, max is  1000 
#Ex=18, #Q=296

Best test: (selected(A,B,C),helpful_unstack(A,B,D,E,F),helpful_pickup(A,B,D,G)),static_fact_block_positive(B,G)
Sampling check:  10  examples, max is  1000 
#Ex=10, #Q=296
Leaf: [putdown_neg_neg] - 10.0
Leaf: [pickup] - 8.0
Sampling check:  122  examples, max is  1000 
#Ex=122, #Q=191

Best test: (selected(A,B,C),helpful_unstack(A,B,D,E,F),static_fact_hand_negative(B,D)),helpful_pickup(A,B,G,H)
Leaf: [unstack] - 37.0
Sampling check:  85  examples, max is  1000 
#Ex=85, #Q=413

Best test: (selected(A,B,C),helpful_unstack(A,B,D,E,F),static_fact_hand_negative(B,D),helpful_pickup(A,B,G,H)),target_goal_on(A,B,I,E)
Sampling check:  43  examples, max is  1000 
#Ex=43, #Q=413

Best test: (selected(A,B,C),helpful_unstack(A,B,D,E,F),static_fact_hand_negative(B,D),helpful_pickup(A,B,G,H)),static_fact_block_negative(B,E)
Sampling check:  31  examples, max is  1000 
#Ex=31, #Q=413

Best test: (selected(A,B,C),helpful_unstack(A,B,D,E,F),static_fact_hand_negative(B,D),helpful_pickup(A,B,G,H)),target_goal_on(A,B,H,F)
Leaf: [pickup] - 9.0
Sampling check:  22  examples, max is  1000 
#Ex=22, #Q=413
Leaf: [pickup] - 22.0
Leaf: [unstack] - 12.0
Sampling check:  42  examples, max is  1000 
#Ex=42, #Q=594

Best test: (selected(A,B,C),helpful_unstack(A,B,D,E,F),static_fact_hand_negative(B,D),helpful_pickup(A,B,G,H),target_goal_on(A,B,I,E)),target_goal_on(A,B,F,E)
Leaf: [unstack] - 31.0
Sampling check:  11  examples, max is  1000 
#Ex=11, #Q=594

Best test: (selected(A,B,C),helpful_unstack(A,B,D,E,F),static_fact_hand_negative(B,D),helpful_pickup(A,B,G,H),target_goal_on(A,B,I,E),target_goal_on(A,B,F,E)),static_fact_block_positive(B,E)
Leaf: [unstack] - 6.0
Leaf: [unstack] - 5.0
Sampling check:  78  examples, max is  1000 
#Ex=78, #Q=191

Best test: (selected(A,B,C),helpful_stack_pos_pos(A,B,D,E,F)),target_goal_on(A,B,E,F)
Leaf: [unstack] - 18.0
Sampling check:  60  examples, max is  1000 
#Ex=60, #Q=191

Best test: (selected(A,B,C),helpful_stack_pos_pos(A,B,D,E,F),target_goal_on(A,B,E,F)),target_goal_on(A,B,F,G)
Sampling check:  46  examples, max is  1000 
#Ex=46, #Q=191

Best test: (selected(A,B,C),helpful_stack_pos_pos(A,B,D,E,F),target_goal_on(A,B,E,F)),helpful_unstack(A,B,G,H,I)
Leaf: [stack_pos_pos] - 31.0
Sampling check:  15  examples, max is  1000 
#Ex=15, #Q=594

Best test: (selected(A,B,C),helpful_stack_pos_pos(A,B,D,E,F),target_goal_on(A,B,E,F),helpful_unstack(A,B,G,H,I)),target_goal_on(A,B,I,J)
Leaf: [stack_pos_pos] - 6.0
Leaf: [stack_pos_pos] - 9.0
Sampling check:  14  examples, max is  1000 
#Ex=14, #Q=296

Best test: (selected(A,B,C),helpful_stack_pos_pos(A,B,D,E,F),target_goal_on(A,B,E,F),target_goal_on(A,B,F,G)),helpful_pickup(A,B,H,F)
Leaf: [unstack] - 5.0
Leaf: [putdown_pos_pos] - 9.0
Sampling check:  129  examples, max is  1000 
#Ex=129, #Q=191

Best test: (selected(A,B,C),helpful_stack_neg_neg(A,B,D,E,F)),target_goal_on(A,B,E,F)
Sampling check:  50  examples, max is  1000 
#Ex=50, #Q=191

Best test: (selected(A,B,C),helpful_stack_neg_neg(A,B,D,E,F)),target_goal_on(A,B,G,E)
Sampling check:  15  examples, max is  1000 
#Ex=15, #Q=191

Best test: (selected(A,B,C),helpful_stack_neg_neg(A,B,D,E,F)),target_goal_on(A,B,E,G)
Leaf: [stack_pos_pos] - 9.0
Leaf: [putdown_neg_neg] - 6.0
Sampling check:  35  examples, max is  1000 
#Ex=35, #Q=296

Best test: (selected(A,B,C),helpful_stack_neg_neg(A,B,D,E,F),target_goal_on(A,B,G,E)),target_goal_on(A,B,E,H)
Sampling check:  27  examples, max is  1000 
#Ex=27, #Q=296

Best test: (selected(A,B,C),helpful_stack_neg_neg(A,B,D,E,F),target_goal_on(A,B,G,E)),target_goal_on(A,B,H,G)
Leaf: [putdown_neg_neg] - 6.0
Leaf: [putdown_neg_neg] - 21.0
Leaf: [unstack] - 8.0
Sampling check:  79  examples, max is  1000 
#Ex=79, #Q=191

Best test: (selected(A,B,C),helpful_stack_neg_neg(A,B,D,E,F),target_goal_on(A,B,E,F)),target_goal_on(A,B,F,G)
Sampling check:  64  examples, max is  1000 
#Ex=64, #Q=191

Best test: (selected(A,B,C),helpful_stack_neg_neg(A,B,D,E,F),target_goal_on(A,B,E,F)),helpful_unstack(A,B,G,F,H)
Sampling check:  57  examples, max is  1000 
#Ex=57, #Q=191

Best test: (selected(A,B,C),helpful_stack_neg_neg(A,B,D,E,F),target_goal_on(A,B,E,F)),helpful_putdown_pos_pos(A,B,G,H)
Sampling check:  48  examples, max is  1000 
#Ex=48, #Q=191

Best test: (selected(A,B,C),helpful_stack_neg_neg(A,B,D,E,F),target_goal_on(A,B,E,F)),helpful_unstack(A,B,G,H,I)
Leaf: [stack_neg_neg] - 27.0
Sampling check:  21  examples, max is  1000 
#Ex=21, #Q=594

Best test: (selected(A,B,C),helpful_stack_neg_neg(A,B,D,E,F),target_goal_on(A,B,E,F),helpful_unstack(A,B,G,H,I)),target_goal_on(A,B,J,I)
Leaf: [stack_neg_neg] - 12.0
Leaf: [stack_neg_neg] - 9.0
Leaf: [stack_neg_neg] - 9.0
Leaf: [putdown_neg_neg] - 7.0
Sampling check:  15  examples, max is  1000 
#Ex=15, #Q=296

Best test: (selected(A,B,C),helpful_stack_neg_neg(A,B,D,E,F),target_goal_on(A,B,E,F),target_goal_on(A,B,F,G)),helpful_pickup(A,B,H,F)
Leaf: [stack_pos_pos] - 7.0
Leaf: [pickup] - 8.0
Sampling check:  15  examples, max is  1000 
#Ex=15, #Q=191

Best test: (selected(A,B,C),helpful_stack_neg_pos(A,B,D,E,F)),target_goal_on(A,B,F,G)
Leaf: [stack_neg_pos] - 10.0
Leaf: [putdown_neg_pos] - 5.0
Sampling check:  18  examples, max is  1000 
#Ex=18, #Q=191

Best test: (selected(A,B,C),helpful_stack_pos_neg(A,B,D,E,F)),helpful_unstack(A,B,G,H,I)
Leaf: [stack_pos_neg] - 12.0
Leaf: [stack_pos_neg] - 6.0

Refinement finished. 
Output written to file '/home/tomas/sayphi/domains/matching-bw/roller/siblings-episodes/tilde/siblings-episodes.out'.


ace-siblings-episodes> quit

Au revoir!

