75 lines
		
	
	
		
			4.4 KiB
		
	
	
	
		
			Plaintext
		
	
	
	
	
	
			
		
		
	
	
			75 lines
		
	
	
		
			4.4 KiB
		
	
	
	
		
			Plaintext
		
	
	
	
	
	
planner.py version 0.0.1
 | 
						|
 | 
						|
Time:	 0.14s
 | 
						|
Memory: 56MB
 | 
						|
 | 
						|
Iteration 1
 | 
						|
Queue:		 [(0,0,0,True), (1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
 | 
						|
Grounded Until:	 0
 | 
						|
Solving...
 | 
						|
Solving Time:	 0.00s
 | 
						|
Memory:		 56MB (+0MB)
 | 
						|
UNSAT
 | 
						|
Iteration Time:	 0.00s
 | 
						|
 | 
						|
Iteration 2
 | 
						|
Queue:		 [(1,5,0,True), (2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
 | 
						|
Grounded Until:	 0
 | 
						|
Grounding...	 [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
 | 
						|
Grounding Time:	 0.09s
 | 
						|
Memory:		 64MB (+8MB)
 | 
						|
Unblocking actions...
 | 
						|
Solving...
 | 
						|
Solving Time:	 0.00s
 | 
						|
Memory:		 66MB (+2MB)
 | 
						|
UNSAT
 | 
						|
Iteration Time:	 0.11s
 | 
						|
 | 
						|
Iteration 3
 | 
						|
Queue:		 [(2,10,0,True), (3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
 | 
						|
Grounded Until:	 5
 | 
						|
Grounding...	 [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
 | 
						|
Grounding Time:	 0.08s
 | 
						|
Memory:		 71MB (+5MB)
 | 
						|
Unblocking actions...
 | 
						|
Solving...
 | 
						|
Answer: 1
 | 
						|
occurs(action(("walk",constant("driver1"),constant("s4"),constant("p4-0"))),1) occurs(action(("walk",constant("driver1"),constant("p4-0"),constant("s0"))),2) occurs(action(("walk",constant("driver2"),constant("s1"),constant("p0-1"))),2) occurs(action(("board-truck",constant("driver1"),constant("truck2"),constant("s0"))),3) occurs(action(("walk",constant("driver2"),constant("p0-1"),constant("s1"))),3) occurs(action(("drive-truck",constant("truck2"),constant("s0"),constant("s3"),constant("driver1"))),4) occurs(action(("walk",constant("driver2"),constant("s1"),constant("p1-2"))),4) occurs(action(("load-truck",constant("package3"),constant("truck2"),constant("s3"))),5) occurs(action(("load-truck",constant("package1"),constant("truck1"),constant("s2"))),5) occurs(action(("drive-truck",constant("truck2"),constant("s3"),constant("s2"),constant("driver1"))),5) occurs(action(("walk",constant("driver2"),constant("p1-2"),constant("s2"))),5) occurs(action(("drive-truck",constant("truck2"),constant("s2"),constant("s1"),constant("driver1"))),6) occurs(action(("board-truck",constant("driver2"),constant("truck1"),constant("s2"))),6) occurs(action(("unload-truck",constant("package3"),constant("truck2"),constant("s1"))),7) occurs(action(("drive-truck",constant("truck1"),constant("s2"),constant("s3"),constant("driver2"))),7) occurs(action(("load-truck",constant("package2"),constant("truck2"),constant("s1"))),7) occurs(action(("drive-truck",constant("truck2"),constant("s1"),constant("s2"),constant("driver1"))),7) occurs(action(("unload-truck",constant("package2"),constant("truck2"),constant("s2"))),8) occurs(action(("unload-truck",constant("package1"),constant("truck1"),constant("s3"))),8) occurs(action(("drive-truck",constant("truck2"),constant("s2"),constant("s3"),constant("driver1"))),8) occurs(action(("disembark-truck",constant("driver2"),constant("truck1"),constant("s3"))),8) occurs(action(("disembark-truck",constant("driver1"),constant("truck2"),constant("s3"))),9) occurs(action(("load-truck",constant("package1"),constant("truck2"),constant("s3"))),9) occurs(action(("walk",constant("driver2"),constant("s3"),constant("p3-4"))),9) occurs(action(("unload-truck",constant("package1"),constant("truck2"),constant("s3"))),10) occurs(action(("walk",constant("driver2"),constant("p3-4"),constant("s4"))),10)
 | 
						|
Solving Time:	 0.21s
 | 
						|
Memory:		 72MB (+1MB)
 | 
						|
SAT
 | 
						|
SATISFIABLE
 | 
						|
 | 
						|
Models       : 1+
 | 
						|
Calls        : 3
 | 
						|
Time         : 0.560s (Solving: 0.20s 1st Model: 0.20s Unsat: 0.00s)
 | 
						|
CPU Time     : 0.560s
 | 
						|
 | 
						|
Choices      : 13793   
 | 
						|
Conflicts    : 6266     (Analyzed: 6266)
 | 
						|
Restarts     : 63       (Average: 99.46 Last: 75)
 | 
						|
Model-Level  : 43.0    
 | 
						|
Problems     : 3        (Average Length: 7.00 Splits: 0)
 | 
						|
Lemmas       : 6266     (Deleted: 1720)
 | 
						|
  Binary     : 1392     (Ratio:  22.22%)
 | 
						|
  Ternary    : 247      (Ratio:   3.94%)
 | 
						|
  Conflict   : 6266     (Average Length:   27.6 Ratio: 100.00%) 
 | 
						|
  Loop       : 0        (Average Length:    0.0 Ratio:   0.00%) 
 | 
						|
  Other      : 0        (Average Length:    0.0 Ratio:   0.00%) 
 | 
						|
Backjumps    : 6266     (Average:  2.15 Max:  79 Sum:  13442)
 | 
						|
  Executed   : 6256     (Average:  2.13 Max:  79 Sum:  13322 Ratio:  99.11%)
 | 
						|
  Bounded    : 10       (Average: 12.00 Max:  12 Sum:    120 Ratio:   0.89%)
 | 
						|
 | 
						|
Rules        : 34034   
 | 
						|
Atoms        : 34034   
 | 
						|
Bodies       : 1        (Original: 0)
 | 
						|
Tight        : Yes
 | 
						|
Variables    : 11425    (Eliminated:    0 Frozen: 7675)
 | 
						|
Constraints  : 17642    (Binary:  90.0% Ternary:   6.2% Other:   3.8%)
 | 
						|
 | 
						|
Memory Peak  : 72MB
 | 
						|
Max. Length  : 10 steps
 | 
						|
Sol. Length  : 10 steps
 | 
						|
 | 
						|
 |