Add benchmark result [gc-ta1-tt1 | ipc-2011 | peg-solitaire-sequential-satisficing | 2]
This commit is contained in:
parent
9c486644ae
commit
15304fc8cf
@ -0,0 +1,53 @@
|
||||
command:
|
||||
- timeout
|
||||
- -m=9216000
|
||||
- -t=900
|
||||
- python3
|
||||
- /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py
|
||||
- --domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/domain.pddl
|
||||
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/instances/instance-2.pddl
|
||||
- --stats
|
||||
- --verbose
|
||||
- --print-call
|
||||
- -m 8192
|
||||
- --translate
|
||||
- -B 0.9
|
||||
- --parallel=0
|
||||
- --shallow
|
||||
- --use-heuristic
|
||||
- --test-until-not-sat
|
||||
- --test=0
|
||||
- --test-add=1
|
||||
- --test-times=1
|
||||
configuration:
|
||||
id: gc-ta1-tt1
|
||||
instanceSets:
|
||||
- lpnmr-first-plan-not-serializable
|
||||
- rintanen-aij-2012
|
||||
options:
|
||||
- --stats
|
||||
- --verbose
|
||||
- --print-call
|
||||
- -m 8192
|
||||
- --translate
|
||||
- -B 0.9
|
||||
- --parallel=0
|
||||
- --shallow
|
||||
- --use-heuristic
|
||||
- --test-until-not-sat
|
||||
- --test=0
|
||||
- --test-add=1
|
||||
- --test-times=1
|
||||
exitCode: 0
|
||||
instance:
|
||||
domain: peg-solitaire-sequential-satisficing
|
||||
instance: 2
|
||||
ipc: ipc-2011
|
||||
versions:
|
||||
clingo: 5.2.2
|
||||
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
|
||||
planner: 398fcb36ad9c5a23a8c35820fb4b021802dbc349 (2017-11-30 17:03:27 +0100)
|
||||
plasp: 3.1.1
|
||||
python: 3.6.3
|
||||
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||
|
@ -0,0 +1,24 @@
|
||||
# configuration: {'id': 'gc-ta1-tt1', 'options': ['--stats', '--verbose', '--print-call', '-m 8192', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--test-times=1'], 'instanceSets': ['lpnmr-first-plan-not-serializable', 'rintanen-aij-2012']}
|
||||
# instance: {'ipc': 'ipc-2011', 'domain': 'peg-solitaire-sequential-satisficing', 'instance': 2}
|
||||
# command: ['timeout', '-m=9216000', '-t=900', 'python3', '/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py', '--domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/instances/instance-2.pddl', '--stats', '--verbose', '--print-call', '-m 8192', '--translate', '-B 0.9', '--parallel=0', '--shallow', '--use-heuristic', '--test-until-not-sat', '--test=0', '--test-add=1', '--test-times=1']
|
||||
# working directory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||
# exit code: 0
|
||||
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:66:15-28: info: atom does not occur in any rule head:
|
||||
mutexGroup(G)
|
||||
|
||||
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:66:30-45: info: atom does not occur in any rule head:
|
||||
contains(G,X,V)
|
||||
|
||||
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:67:15-28: info: atom does not occur in any rule head:
|
||||
mutexGroup(G)
|
||||
|
||||
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:74:41-56: info: atom does not occur in any rule head:
|
||||
contains(G,X,V)
|
||||
|
||||
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp:84:41-56: info: atom does not occur in any rule head:
|
||||
contains(G,X,V)
|
||||
|
||||
# planner call: /home/wv/bin/linux/64/fast-downward/fast-downward.py --translate --build=release64 /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/instances/instance-2.pddl && plasp-3.1.1 translate --parsing-mode=compatibility output.sas | /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/planner.py - /home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp /home/pluehne/Documents/ASP/plasp-javier/encodings/strips/strips-incremental.lp --stats --verbose -m 8192 -B 0.9 --test-until-not-sat --query-at-last --check-at-last --forbid-actions --force-actions -c planner_on=1 --test=- --test=/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/test_files/test.lp /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/test_files/block_forall_t.lp --test-once --heuristic=Domain /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/heuristic.lp -c _shallow=1 -c _closure=3 -c _parallel=0
|
||||
FINISHED CPU 29.38 MEM 33472 MAXMEM 142688 STALE 1 MAXMEM_RSS 86296
|
||||
<time name="ALL">29340</time>
|
||||
|
409
gc-ta1-tt1/ipc-2011_peg-solitaire-sequential-satisficing_2.out
Normal file
409
gc-ta1-tt1/ipc-2011_peg-solitaire-sequential-satisficing_2.out
Normal file
@ -0,0 +1,409 @@
|
||||
INFO Running translator.
|
||||
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/instances/instance-2.pddl']
|
||||
INFO translator arguments: []
|
||||
INFO translator time limit: None
|
||||
INFO translator memory limit: None
|
||||
INFO callstring: /home/pluehne/.usr/bin/python /home/wv/bin/linux/64/fast-downward-10997/builds/release64/bin/translate/translate.py /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/peg-solitaire-sequential-satisficing/instances/instance-2.pddl
|
||||
Parsing...
|
||||
Parsing: [0.030s CPU, 0.034s wall-clock]
|
||||
Normalizing task... [0.000s CPU, 0.002s wall-clock]
|
||||
Instantiating...
|
||||
Generating Datalog program... [0.010s CPU, 0.009s wall-clock]
|
||||
Normalizing Datalog program...
|
||||
Normalizing Datalog program: [0.010s CPU, 0.017s wall-clock]
|
||||
Preparing model... [0.020s CPU, 0.021s wall-clock]
|
||||
Generated 25 rules.
|
||||
Computing model... [0.110s CPU, 0.103s wall-clock]
|
||||
461 relevant atoms
|
||||
611 auxiliary atoms
|
||||
1072 final queue length
|
||||
1647 total queue pushes
|
||||
Completing instantiation... [0.090s CPU, 0.091s wall-clock]
|
||||
Instantiating: [0.240s CPU, 0.243s wall-clock]
|
||||
Computing fact groups...
|
||||
Finding invariants...
|
||||
7 initial candidates
|
||||
Finding invariants: [0.030s CPU, 0.025s wall-clock]
|
||||
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||||
Instantiating groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Choosing groups...
|
||||
0 uncovered facts
|
||||
Choosing groups: [0.010s CPU, 0.003s wall-clock]
|
||||
Building translation key... [0.000s CPU, 0.001s wall-clock]
|
||||
Computing fact groups: [0.040s CPU, 0.038s wall-clock]
|
||||
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||||
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||
Building mutex information...
|
||||
Building mutex information: [0.000s CPU, 0.001s wall-clock]
|
||||
Translating task...
|
||||
Processing axioms...
|
||||
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||
Processing axioms: [0.000s CPU, 0.004s wall-clock]
|
||||
Translating task: [0.080s CPU, 0.074s wall-clock]
|
||||
0 effect conditions simplified
|
||||
0 implied preconditions added
|
||||
Detecting unreachable propositions...
|
||||
0 operators removed
|
||||
0 axioms removed
|
||||
34 propositions removed
|
||||
Detecting unreachable propositions: [0.040s CPU, 0.040s wall-clock]
|
||||
Reordering and filtering variables...
|
||||
34 of 34 variables necessary.
|
||||
0 of 34 mutex groups necessary.
|
||||
185 of 185 operators necessary.
|
||||
0 of 0 axiom rules necessary.
|
||||
Reordering and filtering variables: [0.020s CPU, 0.024s wall-clock]
|
||||
Translator variables: 34
|
||||
Translator derived variables: 0
|
||||
Translator facts: 100
|
||||
Translator goal facts: 33
|
||||
Translator mutex groups: 0
|
||||
Translator total mutex groups size: 0
|
||||
Translator operators: 185
|
||||
Translator axioms: 0
|
||||
Translator task size: 1634
|
||||
Translator peak memory: 37068 KB
|
||||
Writing output... [0.030s CPU, 0.030s wall-clock]
|
||||
Done! [0.480s CPU, 0.490s wall-clock]
|
||||
planner.py version 0.0.1
|
||||
|
||||
Time: 0.07s
|
||||
Memory: 52MB
|
||||
|
||||
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: 52MB (+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
|
||||
Expected Memory: 52MB
|
||||
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 53MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.00s
|
||||
Memory: 54MB (+1MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.03s
|
||||
|
||||
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
|
||||
Expected Memory: 56.0MB
|
||||
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 55MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.01s
|
||||
Memory: 56MB (+1MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.04s
|
||||
|
||||
Iteration 4
|
||||
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||
Grounded Until: 10
|
||||
Expected Memory: 58.0MB
|
||||
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||||
Grounding Time: 0.03s
|
||||
Memory: 57MB (+1MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.50s
|
||||
Memory: 60MB (+3MB)
|
||||
UNSAT
|
||||
Iteration Time: 0.53s
|
||||
|
||||
Iteration 5
|
||||
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||
Grounded Until: 15
|
||||
Expected Memory: 64.0MB
|
||||
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 62MB (+2MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.02s
|
||||
Memory: 66MB (+4MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.05s
|
||||
|
||||
Iteration 6
|
||||
Queue: [(5,25,0,True), (6,30,0,True)]
|
||||
Grounded Until: 20
|
||||
Expected Memory: 72.0MB
|
||||
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 66MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.95s
|
||||
Memory: 68MB (+2MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 0.98s
|
||||
|
||||
Iteration 7
|
||||
Queue: [(6,30,0,True)]
|
||||
Grounded Until: 25
|
||||
Expected Memory: 74.0MB
|
||||
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 68MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.17s
|
||||
Memory: 69MB (+1MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.21s
|
||||
|
||||
Iteration 8
|
||||
Queue: [(4,20,1,True), (5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 30
|
||||
Blocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.12s
|
||||
Memory: 69MB (+0MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.12s
|
||||
|
||||
Iteration 9
|
||||
Queue: [(5,25,1,True), (6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 30
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.11s
|
||||
Memory: 69MB (+0MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.12s
|
||||
|
||||
Iteration 10
|
||||
Queue: [(6,30,1,True), (7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 30
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.19s
|
||||
Memory: 70MB (+1MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.19s
|
||||
|
||||
Iteration 11
|
||||
Queue: [(7,35,0,True), (8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 30
|
||||
Expected Memory: 76.0MB
|
||||
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
|
||||
Grounding Time: 0.03s
|
||||
Memory: 70MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.28s
|
||||
Memory: 74MB (+4MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.33s
|
||||
|
||||
Iteration 12
|
||||
Queue: [(8,40,0,True), (9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 35
|
||||
Expected Memory: 80.0MB
|
||||
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 74MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.38s
|
||||
Memory: 77MB (+3MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.41s
|
||||
|
||||
Iteration 13
|
||||
Queue: [(9,45,0,True), (10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 40
|
||||
Expected Memory: 83.0MB
|
||||
Grounding... [('step', [41]), ('step', [42]), ('step', [43]), ('step', [44]), ('step', [45]), ('check', [45])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 77MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.65s
|
||||
Memory: 81MB (+4MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.69s
|
||||
|
||||
Iteration 14
|
||||
Queue: [(10,50,0,True), (11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 45
|
||||
Expected Memory: 87.0MB
|
||||
Grounding... [('step', [46]), ('step', [47]), ('step', [48]), ('step', [49]), ('step', [50]), ('check', [50])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 81MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.62s
|
||||
Memory: 82MB (+1MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.66s
|
||||
|
||||
Iteration 15
|
||||
Queue: [(11,55,0,True), (12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 50
|
||||
Expected Memory: 88.0MB
|
||||
Grounding... [('step', [51]), ('step', [52]), ('step', [53]), ('step', [54]), ('step', [55]), ('check', [55])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 82MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.50s
|
||||
Memory: 84MB (+2MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.54s
|
||||
|
||||
Iteration 16
|
||||
Queue: [(12,60,0,True), (13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 55
|
||||
Expected Memory: 90.0MB
|
||||
Grounding... [('step', [56]), ('step', [57]), ('step', [58]), ('step', [59]), ('step', [60]), ('check', [60])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 84MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.43s
|
||||
Memory: 84MB (+0MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.47s
|
||||
|
||||
Iteration 17
|
||||
Queue: [(13,65,0,True), (14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 60
|
||||
Expected Memory: 90.0MB
|
||||
Grounding... [('step', [61]), ('step', [62]), ('step', [63]), ('step', [64]), ('step', [65]), ('check', [65])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 84MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.72s
|
||||
Memory: 87MB (+3MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.76s
|
||||
|
||||
Iteration 18
|
||||
Queue: [(14,70,0,True), (15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 65
|
||||
Expected Memory: 93.0MB
|
||||
Grounding... [('step', [66]), ('step', [67]), ('step', [68]), ('step', [69]), ('step', [70]), ('check', [70])]
|
||||
Grounding Time: 0.03s
|
||||
Memory: 87MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.76s
|
||||
Memory: 88MB (+1MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.80s
|
||||
|
||||
Iteration 19
|
||||
Queue: [(15,75,0,True), (16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 70
|
||||
Expected Memory: 94.0MB
|
||||
Grounding... [('step', [71]), ('step', [72]), ('step', [73]), ('step', [74]), ('step', [75]), ('check', [75])]
|
||||
Grounding Time: 0.04s
|
||||
Memory: 90MB (+2MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.82s
|
||||
Memory: 93MB (+3MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.88s
|
||||
|
||||
Iteration 20
|
||||
Queue: [(16,80,0,True), (17,85,0,True)]
|
||||
Grounded Until: 75
|
||||
Expected Memory: 99.0MB
|
||||
Grounding... [('step', [76]), ('step', [77]), ('step', [78]), ('step', [79]), ('step', [80]), ('check', [80])]
|
||||
Grounding Time: 0.03s
|
||||
Memory: 95MB (+2MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 2.08s
|
||||
Memory: 101MB (+6MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 2.13s
|
||||
|
||||
Iteration 21
|
||||
Queue: [(17,85,0,True)]
|
||||
Grounded Until: 80
|
||||
Expected Memory: 109.0MB
|
||||
Grounding... [('step', [81]), ('step', [82]), ('step', [83]), ('step', [84]), ('step', [85]), ('check', [85])]
|
||||
Grounding Time: 0.02s
|
||||
Memory: 101MB (+0MB)
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.92s
|
||||
Memory: 102MB (+1MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.97s
|
||||
|
||||
Iteration 22
|
||||
Queue: [(4,20,2,True), (5,25,2,True), (6,30,2,True), (7,35,1,True), (8,40,1,True), (9,45,1,True), (10,50,1,True), (11,55,1,True), (12,60,1,True), (13,65,1,True), (14,70,1,True), (15,75,1,True), (16,80,1,True), (17,85,1,True), (18,90,0,True), (19,95,0,True), (20,100,0,True), (21,105,0,True)]
|
||||
Grounded Until: 85
|
||||
Blocking actions...
|
||||
Solving...
|
||||
Solving Time: 1.15s
|
||||
Memory: 102MB (+0MB)
|
||||
UNKNOWN
|
||||
Iteration Time: 1.16s
|
||||
|
||||
Iteration 23
|
||||
Queue: [(5,25,2,True), (6,30,2,True), (7,35,1,True), (8,40,1,True), (9,45,1,True), (10,50,1,True), (11,55,1,True), (12,60,1,True), (13,65,1,True), (14,70,1,True), (15,75,1,True), (16,80,1,True), (17,85,1,True), (18,90,0,True), (19,95,0,True), (20,100,0,True), (21,105,0,True)]
|
||||
Grounded Until: 85
|
||||
Unblocking actions...
|
||||
Solving...
|
||||
Solving Time: 0.17s
|
||||
Memory: 102MB (+0MB)
|
||||
SAT
|
||||
Testing...
|
||||
SERIALIZABLE
|
||||
Testing Time: 0.04s
|
||||
Memory: 102MB (+0MB)
|
||||
Answer: 1
|
||||
occurs(action(("jump-new-move","pos-5-4","pos-4-4","pos-3-4")),1) occurs(action(("jump-continue-move","pos-3-4","pos-2-4","pos-1-4")),2) occurs(action(("end-move","pos-1-4")),3) occurs(action(("jump-new-move","pos-2-6","pos-2-5","pos-2-4")),4) occurs(action(("end-move","pos-2-4")),5) occurs(action(("jump-new-move","pos-6-4","pos-6-3","pos-6-2")),6) occurs(action(("end-move","pos-6-2")),7) occurs(action(("jump-new-move","pos-4-6","pos-4-5","pos-4-4")),8) occurs(action(("end-move","pos-4-4")),9) occurs(action(("jump-new-move","pos-1-4","pos-1-3","pos-1-2")),10) occurs(action(("jump-continue-move","pos-1-2","pos-2-2","pos-3-2")),11) occurs(action(("jump-continue-move","pos-3-2","pos-4-2","pos-5-2")),12) occurs(action(("end-move","pos-5-2")),13) occurs(action(("jump-new-move","pos-6-2","pos-5-2","pos-4-2")),14) occurs(action(("end-move","pos-4-2")),15) occurs(action(("jump-new-move","pos-4-1","pos-4-2","pos-4-3")),16) occurs(action(("jump-continue-move","pos-4-3","pos-4-4","pos-4-5")),17) occurs(action(("end-move","pos-4-5")),18) occurs(action(("jump-new-move","pos-3-6","pos-3-5","pos-3-4")),19) occurs(action(("end-move","pos-3-4")),20) occurs(action(("jump-new-move","pos-2-4","pos-3-4","pos-4-4")),21) occurs(action(("end-move","pos-4-4")),22) occurs(action(("jump-new-move","pos-4-5","pos-4-4","pos-4-3")),23) occurs(action(("end-move","pos-4-3")),24) occurs(action(("jump-new-move","pos-5-3","pos-4-3","pos-3-3")),25)
|
||||
SATISFIABLE
|
||||
|
||||
Models : 1+
|
||||
Calls : 23
|
||||
Time : 27.317s (Solving: 26.46s 1st Model: 0.16s Unsat: 0.50s)
|
||||
CPU Time : 27.324s
|
||||
|
||||
Choices : 1108102 (Domain: 1108102)
|
||||
Conflicts : 169787 (Analyzed: 169784)
|
||||
Restarts : 1880 (Average: 90.31 Last: 135)
|
||||
Model-Level : 198.0
|
||||
Problems : 23 (Average Length: 46.57 Splits: 0)
|
||||
Lemmas : 169784 (Deleted: 158709)
|
||||
Binary : 1304 (Ratio: 0.77%)
|
||||
Ternary : 570 (Ratio: 0.34%)
|
||||
Conflict : 169784 (Average Length: 580.4 Ratio: 100.00%)
|
||||
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||
Backjumps : 169784 (Average: 3.00 Max: 594 Sum: 508505)
|
||||
Executed : 169660 (Average: 2.99 Max: 594 Sum: 508102 Ratio: 99.92%)
|
||||
Bounded : 124 (Average: 3.25 Max: 31 Sum: 403 Ratio: 0.08%)
|
||||
|
||||
Rules : 4920
|
||||
Atoms : 4920
|
||||
Bodies : 1 (Original: 0)
|
||||
Tight : Yes
|
||||
Variables : 32746 (Eliminated: 0 Frozen: 2863)
|
||||
Constraints : 197268 (Binary: 92.8% Ternary: 4.6% Other: 2.6%)
|
||||
|
||||
Memory Peak : 105MB
|
||||
Max. Length : 85 steps
|
||||
Sol. Length : 25 steps
|
||||
Models : 1
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user