Add benchmark result [gc-ta1-tt1 | ipc-2006 | storage-propositional | 19]
This commit is contained in:
parent
c78b6bfd0a
commit
76be03b222
GPG Key ID:
1F54208CE70DDF73
53
gc-ta1-tt1/ipc-2006_storage-propositional_19.env
Normal file
53
gc-ta1-tt1/ipc-2006_storage-propositional_19.env
Normal file
@ -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-2006/domains/storage-propositional/domain.pddl
|
||||||
|
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/instances/instance-19.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: storage-propositional
|
||||||
|
instance: 19
|
||||||
|
ipc: ipc-2006
|
||||||
|
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
|
||||||
|
|
||||||
18
gc-ta1-tt1/ipc-2006_storage-propositional_19.err
Normal file
18
gc-ta1-tt1/ipc-2006_storage-propositional_19.err
Normal file
@ -0,0 +1,18 @@
|
|||||||
|
# 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-2006', 'domain': 'storage-propositional', 'instance': 19}
|
||||||
|
# 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-2006/domains/storage-propositional/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/instances/instance-19.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/preprocess.lp:13:4-34: info: atom does not occur in any rule head:
|
||||||
|
requires(feature(actionCosts))
|
||||||
|
|
||||||
|
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:14:4-33: info: atom does not occur in any rule head:
|
||||||
|
requires(feature(axiomRules))
|
||||||
|
|
||||||
|
/home/pluehne/Documents/ASP/plasp-javier/encodings/strips/preprocess.lp:15:4-41: info: atom does not occur in any rule head:
|
||||||
|
requires(feature(conditionalEffects))
|
||||||
|
|
||||||
|
# planner call: /home/wv/bin/linux/64/fast-downward/fast-downward.py --translate --build=release64 /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/instances/instance-19.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 133.61 MEM 33472 MAXMEM 330720 STALE 1 MAXMEM_RSS 268624
|
||||||
|
<time name="ALL">133480</time>
|
||||||
|
|
||||||
279
gc-ta1-tt1/ipc-2006_storage-propositional_19.out
Normal file
279
gc-ta1-tt1/ipc-2006_storage-propositional_19.out
Normal file
@ -0,0 +1,279 @@
|
|||||||
|
INFO Running translator.
|
||||||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/instances/instance-19.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-2006/domains/storage-propositional/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2006/domains/storage-propositional/instances/instance-19.pddl
|
||||||
|
Parsing...
|
||||||
|
Parsing: [0.030s CPU, 0.030s wall-clock]
|
||||||
|
Normalizing task... [0.010s CPU, 0.002s wall-clock]
|
||||||
|
Instantiating...
|
||||||
|
Generating Datalog program... [0.010s CPU, 0.013s wall-clock]
|
||||||
|
Normalizing Datalog program...
|
||||||
|
Normalizing Datalog program: [0.020s CPU, 0.026s wall-clock]
|
||||||
|
Preparing model... [0.030s CPU, 0.029s wall-clock]
|
||||||
|
Generated 43 rules.
|
||||||
|
Computing model... [0.560s CPU, 0.559s wall-clock]
|
||||||
|
3862 relevant atoms
|
||||||
|
3168 auxiliary atoms
|
||||||
|
7030 final queue length
|
||||||
|
14281 total queue pushes
|
||||||
|
Completing instantiation... [1.210s CPU, 1.205s wall-clock]
|
||||||
|
Instantiating: [1.830s CPU, 1.841s wall-clock]
|
||||||
|
Computing fact groups...
|
||||||
|
Finding invariants...
|
||||||
|
16 initial candidates
|
||||||
|
Finding invariants: [0.050s CPU, 0.046s wall-clock]
|
||||||
|
Checking invariant weight... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Instantiating groups... [0.020s CPU, 0.016s wall-clock]
|
||||||
|
Collecting mutex groups... [0.010s CPU, 0.002s wall-clock]
|
||||||
|
Choosing groups...
|
||||||
|
111 uncovered facts
|
||||||
|
Choosing groups: [0.010s CPU, 0.008s wall-clock]
|
||||||
|
Building translation key... [0.010s CPU, 0.008s wall-clock]
|
||||||
|
Computing fact groups: [0.110s CPU, 0.105s wall-clock]
|
||||||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.003s wall-clock]
|
||||||
|
Building dictionary for full mutex groups... [0.010s CPU, 0.006s wall-clock]
|
||||||
|
Building mutex information...
|
||||||
|
Building mutex information: [0.000s CPU, 0.004s wall-clock]
|
||||||
|
Translating task...
|
||||||
|
Processing axioms...
|
||||||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||||
|
Processing axioms: [0.070s CPU, 0.064s wall-clock]
|
||||||
|
Translating task: [1.400s CPU, 1.399s wall-clock]
|
||||||
|
4536 effect conditions simplified
|
||||||
|
0 implied preconditions added
|
||||||
|
Detecting unreachable propositions...
|
||||||
|
0 operators removed
|
||||||
|
0 axioms removed
|
||||||
|
66 propositions removed
|
||||||
|
Detecting unreachable propositions: [0.680s CPU, 0.679s wall-clock]
|
||||||
|
Reordering and filtering variables...
|
||||||
|
51 of 96 variables necessary.
|
||||||
|
3 of 15 mutex groups necessary.
|
||||||
|
3114 of 3114 operators necessary.
|
||||||
|
0 of 0 axiom rules necessary.
|
||||||
|
Reordering and filtering variables: [0.340s CPU, 0.339s wall-clock]
|
||||||
|
Translator variables: 51
|
||||||
|
Translator derived variables: 0
|
||||||
|
Translator facts: 432
|
||||||
|
Translator goal facts: 9
|
||||||
|
Translator mutex groups: 3
|
||||||
|
Translator total mutex groups size: 30
|
||||||
|
Translator operators: 3114
|
||||||
|
Translator axioms: 0
|
||||||
|
Translator task size: 22824
|
||||||
|
Translator peak memory: 52172 KB
|
||||||
|
Writing output... [0.530s CPU, 0.566s wall-clock]
|
||||||
|
Done! [5.000s CPU, 5.033s wall-clock]
|
||||||
|
planner.py version 0.0.1
|
||||||
|
|
||||||
|
Time: 0.99s
|
||||||
|
Memory: 113MB
|
||||||
|
|
||||||
|
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: 113MB (+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: 113MB
|
||||||
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||||
|
Grounding Time: 0.28s
|
||||||
|
Memory: 113MB (+0MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.03s
|
||||||
|
Memory: 116MB (+3MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.45s
|
||||||
|
|
||||||
|
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: 119.0MB
|
||||||
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||||||
|
Grounding Time: 0.34s
|
||||||
|
Memory: 124MB (+8MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.36s
|
||||||
|
Memory: 134MB (+10MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
NOT SERIALIZABLE
|
||||||
|
Testing Time: 0.99s
|
||||||
|
Memory: 173MB (+39MB)
|
||||||
|
Solving...
|
||||||
|
Solving Time: 5.06s
|
||||||
|
Memory: 169MB (+-4MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 6.90s
|
||||||
|
|
||||||
|
Iteration 4
|
||||||
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||||
|
Grounded Until: 10
|
||||||
|
Expected Memory: 187.0MB
|
||||||
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||||||
|
Grounding Time: 0.51s
|
||||||
|
Memory: 169MB (+0MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 10.78s
|
||||||
|
Memory: 178MB (+9MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 11.46s
|
||||||
|
|
||||||
|
Iteration 5
|
||||||
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||||
|
Grounded Until: 15
|
||||||
|
Expected Memory: 196.0MB
|
||||||
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||||||
|
Grounding Time: 0.58s
|
||||||
|
Memory: 197MB (+19MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 15.11s
|
||||||
|
Memory: 205MB (+8MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 15.88s
|
||||||
|
|
||||||
|
Iteration 6
|
||||||
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||||||
|
Grounded Until: 20
|
||||||
|
Expected Memory: 232.0MB
|
||||||
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||||||
|
Grounding Time: 0.51s
|
||||||
|
Memory: 218MB (+13MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 14.88s
|
||||||
|
Memory: 235MB (+17MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 15.60s
|
||||||
|
|
||||||
|
Iteration 7
|
||||||
|
Queue: [(6,30,0,True)]
|
||||||
|
Grounded Until: 25
|
||||||
|
Expected Memory: 265.0MB
|
||||||
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
||||||
|
Grounding Time: 0.51s
|
||||||
|
Memory: 241MB (+6MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 13.57s
|
||||||
|
Memory: 250MB (+9MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 14.30s
|
||||||
|
|
||||||
|
Iteration 8
|
||||||
|
Queue: [(2,10,1,True), (3,15,1,True), (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)]
|
||||||
|
Grounded Until: 30
|
||||||
|
Blocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 5.57s
|
||||||
|
Memory: 253MB (+3MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 5.58s
|
||||||
|
|
||||||
|
Iteration 9
|
||||||
|
Queue: [(3,15,1,True), (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)]
|
||||||
|
Grounded Until: 30
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 7.47s
|
||||||
|
Memory: 253MB (+0MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 7.48s
|
||||||
|
|
||||||
|
Iteration 10
|
||||||
|
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)]
|
||||||
|
Grounded Until: 30
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 10.63s
|
||||||
|
Memory: 253MB (+0MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 10.64s
|
||||||
|
|
||||||
|
Iteration 11
|
||||||
|
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)]
|
||||||
|
Grounded Until: 30
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 11.91s
|
||||||
|
Memory: 253MB (+0MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 11.92s
|
||||||
|
|
||||||
|
Iteration 12
|
||||||
|
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)]
|
||||||
|
Grounded Until: 30
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 21.17s
|
||||||
|
Memory: 253MB (+0MB)
|
||||||
|
UNKNOWN
|
||||||
|
Iteration Time: 21.18s
|
||||||
|
|
||||||
|
Iteration 13
|
||||||
|
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)]
|
||||||
|
Grounded Until: 30
|
||||||
|
Expected Memory: 283.0MB
|
||||||
|
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
|
||||||
|
Grounding Time: 0.54s
|
||||||
|
Memory: 263MB (+10MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 3.53s
|
||||||
|
Memory: 285MB (+22MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
SERIALIZABLE?
|
||||||
|
Testing Time: 0.00s
|
||||||
|
Memory: 285MB (+0MB)
|
||||||
|
Answer: 2
|
||||||
|
occurs(action(("move","hoist1","depot0-1-2","depot0-1-1")),1) occurs(action(("go-out","hoist2","depot0-2-2","loadarea")),1) occurs(action(("lift","hoist2","crate1","container-0-1","loadarea","container0")),2) occurs(action(("move","hoist0","depot0-1-3","depot0-1-2")),2) occurs(action(("move","hoist1","depot0-1-1","depot0-2-1")),2) occurs(action(("go-in","hoist2","loadarea","depot0-2-2")),3) occurs(action(("drop","hoist2","crate1","depot0-2-3","depot0-2-2","depot0")),4) occurs(action(("go-out","hoist2","depot0-2-2","loadarea")),5) occurs(action(("lift","hoist2","crate0","container-0-0","loadarea","container0")),6) occurs(action(("move","hoist1","depot0-2-1","depot0-1-1")),6) occurs(action(("go-in","hoist2","loadarea","depot0-2-2")),7) occurs(action(("drop","hoist2","crate0","depot0-2-1","depot0-2-2","depot0")),8) occurs(action(("move","hoist0","depot0-1-2","depot0-1-3")),8) occurs(action(("go-out","hoist2","depot0-2-2","loadarea")),9) occurs(action(("lift","hoist2","crate2","container-0-2","loadarea","container0")),10) occurs(action(("drop","hoist2","crate2","depot0-2-2","loadarea","depot0")),11) occurs(action(("lift","hoist2","crate4","container-1-0","loadarea","container1")),12) occurs(action(("go-in","hoist2","loadarea","depot1-2-2")),13) occurs(action(("drop","hoist2","crate4","depot1-2-3","depot1-2-2","depot1")),14) occurs(action(("go-out","hoist2","depot1-2-2","loadarea")),15) occurs(action(("lift","hoist2","crate3","container-0-3","loadarea","container0")),16) occurs(action(("go-in","hoist2","loadarea","depot1-2-2")),17) occurs(action(("drop","hoist2","crate3","depot1-1-2","depot1-2-2","depot1")),18) occurs(action(("go-out","hoist2","depot1-2-2","loadarea")),19) occurs(action(("lift","hoist2","crate5","container-1-1","loadarea","container1")),20) occurs(action(("drop","hoist2","crate5","depot1-2-2","loadarea","depot1")),21) occurs(action(("lift","hoist2","crate8","container-2-0","loadarea","container2")),22) occurs(action(("go-in","hoist2","loadarea","depot2-2-1")),23) occurs(action(("drop","hoist2","crate8","depot2-2-2","depot2-2-1","depot2")),24) occurs(action(("go-out","hoist2","depot2-2-1","loadarea")),25) occurs(action(("lift","hoist2","crate6","container-1-2","loadarea","container1")),26) occurs(action(("go-in","hoist2","loadarea","depot2-2-1")),27) occurs(action(("drop","hoist2","crate6","depot2-1-1","depot2-2-1","depot2")),28) occurs(action(("go-out","hoist2","depot2-2-1","loadarea")),29) occurs(action(("lift","hoist2","crate7","container-1-3","loadarea","container1")),30) occurs(action(("drop","hoist2","crate7","depot2-2-1","loadarea","depot2")),31) occurs(action(("go-in","hoist2","loadarea","container-1-0")),32) occurs(action(("go-out","hoist2","container-1-0","loadarea")),33) occurs(action(("move","hoist1","depot0-1-1","depot0-1-2")),34) occurs(action(("move","hoist1","depot0-1-2","depot0-1-1")),35)
|
||||||
|
SATISFIABLE
|
||||||
|
|
||||||
|
Models : 1+
|
||||||
|
Calls : 14
|
||||||
|
Time : 125.927s (Solving: 119.69s 1st Model: 3.81s Unsat: 0.02s)
|
||||||
|
CPU Time : 125.944s
|
||||||
|
|
||||||
|
Choices : 1566451 (Domain: 1541608)
|
||||||
|
Conflicts : 98874 (Analyzed: 98873)
|
||||||
|
Restarts : 1056 (Average: 93.63 Last: 202)
|
||||||
|
Model-Level : 193.0
|
||||||
|
Problems : 14 (Average Length: 23.43 Splits: 0)
|
||||||
|
Lemmas : 98873 (Deleted: 93752)
|
||||||
|
Binary : 158 (Ratio: 0.16%)
|
||||||
|
Ternary : 66 (Ratio: 0.07%)
|
||||||
|
Conflict : 98873 (Average Length: 716.5 Ratio: 100.00%)
|
||||||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Backjumps : 98873 (Average: 15.34 Max: 869 Sum: 1516369)
|
||||||
|
Executed : 98871 (Average: 15.34 Max: 869 Sum: 1516367 Ratio: 100.00%)
|
||||||
|
Bounded : 2 (Average: 1.00 Max: 1 Sum: 2 Ratio: 0.00%)
|
||||||
|
|
||||||
|
Rules : 131420 (Original: 131355)
|
||||||
|
Atoms : 76193
|
||||||
|
Bodies : 37365 (Original: 37321)
|
||||||
|
Count : 331 (Original: 340)
|
||||||
|
Equivalences : 19320 (Atom=Atom: 25 Body=Body: 0 Other: 19295)
|
||||||
|
Tight : Yes
|
||||||
|
Variables : 138994 (Eliminated: 0 Frozen: 110287)
|
||||||
|
Constraints : 1419346 (Binary: 97.9% Ternary: 1.1% Other: 1.1%)
|
||||||
|
|
||||||
|
Memory Peak : 287MB
|
||||||
|
Max. Length : 35 steps
|
||||||
|
Sol. Length : 35 steps
|
||||||
|
Models : 2
|
||||||
|
|
||||||
|
|
||||||
Loading…
Reference in New Issue
Block a user