Add benchmark result [gc-ta1-tt1 | ipc-2000 | blocks-strips-typed | 21]
This commit is contained in:
parent
8c02b17eb4
commit
5099c552e9
GPG Key ID:
1F54208CE70DDF73
51
gc-ta1-tt1/ipc-2000_blocks-strips-typed_21.env
Normal file
51
gc-ta1-tt1/ipc-2000_blocks-strips-typed_21.env
Normal file
@ -0,0 +1,51 @@
|
|||||||
|
command:
|
||||||
|
- timeout
|
||||||
|
- -m=8000000
|
||||||
|
- -t=900
|
||||||
|
- python3
|
||||||
|
- /home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py
|
||||||
|
- --domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl
|
||||||
|
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-21.pddl
|
||||||
|
- --stats
|
||||||
|
- --verbose
|
||||||
|
- --print-call
|
||||||
|
- --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
|
||||||
|
- --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: blocks-strips-typed
|
||||||
|
instance: 21
|
||||||
|
ipc: ipc-2000
|
||||||
|
versions:
|
||||||
|
clingo: 5.2.2
|
||||||
|
fastDownward: 10997:847cdf0069cab0c8841a9958e783d1a7340fe2e9 (2017-11-02 15:10 +0100)
|
||||||
|
planner: 61750c0521c6104870e5b881c8b0c237e2af4a96 (2017-11-27 07:44:27 +0100)
|
||||||
|
plasp: 3.1.1
|
||||||
|
python: 3.6.3
|
||||||
|
workingDirectory: /home/pluehne/Documents/ASP/plasp-javier/encodings/planner
|
||||||
|
|
||||||
18
gc-ta1-tt1/ipc-2000_blocks-strips-typed_21.err
Normal file
18
gc-ta1-tt1/ipc-2000_blocks-strips-typed_21.err
Normal file
@ -0,0 +1,18 @@
|
|||||||
|
# configuration: {'id': 'gc-ta1-tt1', 'options': ['--stats', '--verbose', '--print-call', '--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-2000', 'domain': 'blocks-strips-typed', 'instance': 21}
|
||||||
|
# command: ['timeout', '-m=8000000', '-t=900', 'python3', '/home/pluehne/Documents/ASP/plasp-javier/encodings/planner/runplanner.py', '--domain=/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-21.pddl', '--stats', '--verbose', '--print-call', '--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-2000/domains/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-21.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 -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 2.40 MEM 33472 MAXMEM 117964 STALE 1 MAXMEM_RSS 55192
|
||||||
|
<time name="ALL">2360</time>
|
||||||
|
|
||||||
225
gc-ta1-tt1/ipc-2000_blocks-strips-typed_21.out
Normal file
225
gc-ta1-tt1/ipc-2000_blocks-strips-typed_21.out
Normal file
@ -0,0 +1,225 @@
|
|||||||
|
INFO Running translator.
|
||||||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-21.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-2000/domains/blocks-strips-typed/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2000/domains/blocks-strips-typed/instances/instance-21.pddl
|
||||||
|
Parsing...
|
||||||
|
Parsing: [0.010s CPU, 0.013s wall-clock]
|
||||||
|
Normalizing task... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Instantiating...
|
||||||
|
Generating Datalog program... [0.010s CPU, 0.002s wall-clock]
|
||||||
|
Normalizing Datalog program...
|
||||||
|
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
|
||||||
|
Preparing model... [0.000s CPU, 0.005s wall-clock]
|
||||||
|
Generated 21 rules.
|
||||||
|
Computing model... [0.060s CPU, 0.057s wall-clock]
|
||||||
|
382 relevant atoms
|
||||||
|
250 auxiliary atoms
|
||||||
|
632 final queue length
|
||||||
|
1054 total queue pushes
|
||||||
|
Completing instantiation... [0.080s CPU, 0.076s wall-clock]
|
||||||
|
Instantiating: [0.160s CPU, 0.152s wall-clock]
|
||||||
|
Computing fact groups...
|
||||||
|
Finding invariants...
|
||||||
|
10 initial candidates
|
||||||
|
Finding invariants: [0.020s CPU, 0.022s wall-clock]
|
||||||
|
Checking invariant weight... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Instantiating groups... [0.000s CPU, 0.004s wall-clock]
|
||||||
|
Collecting mutex groups... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Choosing groups...
|
||||||
|
11 uncovered facts
|
||||||
|
Choosing groups: [0.000s CPU, 0.005s wall-clock]
|
||||||
|
Building translation key... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Computing fact groups: [0.040s CPU, 0.043s wall-clock]
|
||||||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
|
||||||
|
Building dictionary for full mutex groups... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Building mutex information...
|
||||||
|
Building mutex information: [0.000s CPU, 0.003s wall-clock]
|
||||||
|
Translating task...
|
||||||
|
Processing axioms...
|
||||||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||||
|
Processing axioms: [0.010s CPU, 0.004s wall-clock]
|
||||||
|
Translating task: [0.080s CPU, 0.079s wall-clock]
|
||||||
|
290 effect conditions simplified
|
||||||
|
0 implied preconditions added
|
||||||
|
Detecting unreachable propositions...
|
||||||
|
0 operators removed
|
||||||
|
0 axioms removed
|
||||||
|
20 propositions removed
|
||||||
|
Detecting unreachable propositions: [0.040s CPU, 0.042s wall-clock]
|
||||||
|
Reordering and filtering variables...
|
||||||
|
21 of 21 variables necessary.
|
||||||
|
11 of 21 mutex groups necessary.
|
||||||
|
200 of 200 operators necessary.
|
||||||
|
0 of 0 axiom rules necessary.
|
||||||
|
Reordering and filtering variables: [0.030s CPU, 0.025s wall-clock]
|
||||||
|
Translator variables: 21
|
||||||
|
Translator derived variables: 0
|
||||||
|
Translator facts: 132
|
||||||
|
Translator goal facts: 9
|
||||||
|
Translator mutex groups: 11
|
||||||
|
Translator total mutex groups size: 121
|
||||||
|
Translator operators: 200
|
||||||
|
Translator axioms: 0
|
||||||
|
Translator task size: 1753
|
||||||
|
Translator peak memory: 37068 KB
|
||||||
|
Writing output... [0.030s CPU, 0.033s wall-clock]
|
||||||
|
Done! [0.390s CPU, 0.398s wall-clock]
|
||||||
|
planner.py version 0.0.1
|
||||||
|
|
||||||
|
Time: 0.08s
|
||||||
|
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
|
||||||
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||||
|
Grounding Time: 0.03s
|
||||||
|
Memory: 54MB (+2MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 54MB (+0MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.04s
|
||||||
|
|
||||||
|
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.03s
|
||||||
|
Memory: 56MB (+2MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 56MB (+0MB)
|
||||||
|
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
|
||||||
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||||||
|
Grounding Time: 0.03s
|
||||||
|
Memory: 58MB (+2MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 58MB (+0MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.04s
|
||||||
|
|
||||||
|
Iteration 5
|
||||||
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||||
|
Grounded Until: 15
|
||||||
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||||||
|
Grounding Time: 0.03s
|
||||||
|
Memory: 59MB (+1MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 60MB (+1MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.04s
|
||||||
|
|
||||||
|
Iteration 6
|
||||||
|
Queue: [(5,25,0,True), (6,30,0,True)]
|
||||||
|
Grounded Until: 20
|
||||||
|
Grounding... [('step', [21]), ('step', [22]), ('step', [23]), ('step', [24]), ('step', [25]), ('check', [25])]
|
||||||
|
Grounding Time: 0.03s
|
||||||
|
Memory: 61MB (+1MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.00s
|
||||||
|
Memory: 62MB (+1MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.04s
|
||||||
|
|
||||||
|
Iteration 7
|
||||||
|
Queue: [(6,30,0,True)]
|
||||||
|
Grounded Until: 25
|
||||||
|
Grounding... [('step', [26]), ('step', [27]), ('step', [28]), ('step', [29]), ('step', [30]), ('check', [30])]
|
||||||
|
Grounding Time: 0.03s
|
||||||
|
Memory: 64MB (+2MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.01s
|
||||||
|
Memory: 64MB (+0MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.05s
|
||||||
|
|
||||||
|
Iteration 8
|
||||||
|
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)]
|
||||||
|
Grounded Until: 30
|
||||||
|
Grounding... [('step', [31]), ('step', [32]), ('step', [33]), ('step', [34]), ('step', [35]), ('check', [35])]
|
||||||
|
Grounding Time: 0.03s
|
||||||
|
Memory: 66MB (+2MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.07s
|
||||||
|
Memory: 67MB (+1MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.11s
|
||||||
|
|
||||||
|
Iteration 9
|
||||||
|
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)]
|
||||||
|
Grounded Until: 35
|
||||||
|
Grounding... [('step', [36]), ('step', [37]), ('step', [38]), ('step', [39]), ('step', [40]), ('check', [40])]
|
||||||
|
Grounding Time: 0.03s
|
||||||
|
Memory: 69MB (+2MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.01s
|
||||||
|
Memory: 70MB (+1MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
SERIALIZABLE
|
||||||
|
Testing Time: 0.05s
|
||||||
|
Memory: 71MB (+1MB)
|
||||||
|
Answer: 1
|
||||||
|
occurs(action(("unstack","j","i")),1) occurs(action(("put-down","j")),2) occurs(action(("pick-up","c")),3) occurs(action(("put-down","c")),4) occurs(action(("unstack","i","h")),5) occurs(action(("put-down","i")),6) occurs(action(("pick-up","j")),7) occurs(action(("put-down","j")),8) occurs(action(("unstack","h","f")),9) occurs(action(("put-down","h")),10) occurs(action(("unstack","f","d")),11) occurs(action(("put-down","f")),12) occurs(action(("unstack","d","e")),13) occurs(action(("put-down","d")),14) occurs(action(("pick-up","j")),15) occurs(action(("stack","j","d")),16) occurs(action(("pick-up","f")),17) occurs(action(("stack","f","j")),18) occurs(action(("unstack","e","g")),19) occurs(action(("put-down","e")),20) occurs(action(("unstack","g","b")),21) occurs(action(("put-down","g")),22) occurs(action(("unstack","b","a")),23) occurs(action(("put-down","b")),24) occurs(action(("pick-up","a")),25) occurs(action(("stack","a","f")),26) occurs(action(("pick-up","c")),27) occurs(action(("stack","c","a")),28) occurs(action(("pick-up","h")),29) occurs(action(("stack","h","c")),30) occurs(action(("pick-up","g")),31) occurs(action(("stack","g","h")),32) occurs(action(("pick-up","i")),33) occurs(action(("stack","i","g")),34) occurs(action(("pick-up","e")),35) occurs(action(("stack","e","i")),36) occurs(action(("pick-up","b")),37) occurs(action(("put-down","b")),38) occurs(action(("pick-up","b")),39) occurs(action(("stack","b","e")),40)
|
||||||
|
SATISFIABLE
|
||||||
|
|
||||||
|
Models : 1+
|
||||||
|
Calls : 9
|
||||||
|
Time : 0.482s (Solving: 0.08s 1st Model: 0.00s Unsat: 0.07s)
|
||||||
|
CPU Time : 0.480s
|
||||||
|
|
||||||
|
Choices : 3061 (Domain: 3061)
|
||||||
|
Conflicts : 517 (Analyzed: 511)
|
||||||
|
Restarts : 5 (Average: 102.20 Last: 42)
|
||||||
|
Model-Level : 256.0
|
||||||
|
Problems : 9 (Average Length: 22.00 Splits: 0)
|
||||||
|
Lemmas : 511 (Deleted: 0)
|
||||||
|
Binary : 34 (Ratio: 6.65%)
|
||||||
|
Ternary : 6 (Ratio: 1.17%)
|
||||||
|
Conflict : 511 (Average Length: 737.9 Ratio: 100.00%)
|
||||||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Backjumps : 511 (Average: 6.10 Max: 87 Sum: 3116)
|
||||||
|
Executed : 492 (Average: 5.42 Max: 87 Sum: 2769 Ratio: 88.86%)
|
||||||
|
Bounded : 19 (Average: 18.26 Max: 36 Sum: 347 Ratio: 11.14%)
|
||||||
|
|
||||||
|
Rules : 5408
|
||||||
|
Atoms : 5408
|
||||||
|
Bodies : 1 (Original: 0)
|
||||||
|
Tight : Yes
|
||||||
|
Variables : 15101 (Eliminated: 0 Frozen: 4734)
|
||||||
|
Constraints : 78857 (Binary: 92.1% Ternary: 5.2% Other: 2.7%)
|
||||||
|
|
||||||
|
Memory Peak : 72MB
|
||||||
|
Max. Length : 40 steps
|
||||||
|
Sol. Length : 40 steps
|
||||||
|
Models : 1
|
||||||
|
|
||||||
|
|
||||||
Loading…
Reference in New Issue
Block a user