Add benchmark result [gc-ta1-tt1 | ipc-2011 | no-mystery-sequential-satisficing | 10]
This commit is contained in:
parent
fd81faaf3b
commit
72987f0d39
53
gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_10.env
Normal file
53
gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_10.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-2011/domains/no-mystery-sequential-satisficing/domain.pddl
|
||||||
|
- /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-10.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: no-mystery-sequential-satisficing
|
||||||
|
instance: 10
|
||||||
|
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
|
||||||
|
|
24
gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_10.err
Normal file
24
gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_10.err
Normal file
@ -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': 'no-mystery-sequential-satisficing', 'instance': 10}
|
||||||
|
# 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/no-mystery-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-10.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/no-mystery-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-10.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 57.71 MEM 0 MAXMEM 677008 STALE 1 MAXMEM_RSS 619080
|
||||||
|
<time name="ALL">57520</time>
|
||||||
|
|
177
gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_10.out
Normal file
177
gc-ta1-tt1/ipc-2011_no-mystery-sequential-satisficing_10.out
Normal file
@ -0,0 +1,177 @@
|
|||||||
|
INFO Running translator.
|
||||||
|
INFO translator input: ['/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/domain.pddl', '/home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-10.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/no-mystery-sequential-satisficing/domain.pddl /home/pluehne/Documents/ASP/pddl-instances/ipc-2011/domains/no-mystery-sequential-satisficing/instances/instance-10.pddl
|
||||||
|
Parsing...
|
||||||
|
Parsing: [1.640s CPU, 1.648s wall-clock]
|
||||||
|
Normalizing task... [0.040s CPU, 0.037s wall-clock]
|
||||||
|
Instantiating...
|
||||||
|
Generating Datalog program... [0.380s CPU, 0.374s wall-clock]
|
||||||
|
Normalizing Datalog program...
|
||||||
|
Normalizing Datalog program: [0.010s CPU, 0.013s wall-clock]
|
||||||
|
Preparing model... [3.230s CPU, 3.227s wall-clock]
|
||||||
|
Generated 23 rules.
|
||||||
|
Computing model... [7.690s CPU, 7.690s wall-clock]
|
||||||
|
41356 relevant atoms
|
||||||
|
73630 auxiliary atoms
|
||||||
|
114986 final queue length
|
||||||
|
135120 total queue pushes
|
||||||
|
Completing instantiation... [4.600s CPU, 4.608s wall-clock]
|
||||||
|
Instantiating: [16.050s CPU, 16.042s wall-clock]
|
||||||
|
Computing fact groups...
|
||||||
|
Finding invariants...
|
||||||
|
9 initial candidates
|
||||||
|
Finding invariants: [0.100s CPU, 0.107s wall-clock]
|
||||||
|
Checking invariant weight... [0.100s CPU, 0.100s wall-clock]
|
||||||
|
Instantiating groups... [0.110s CPU, 0.112s wall-clock]
|
||||||
|
Collecting mutex groups... [0.010s CPU, 0.003s wall-clock]
|
||||||
|
Choosing groups...
|
||||||
|
0 uncovered facts
|
||||||
|
Choosing groups: [0.010s CPU, 0.010s wall-clock]
|
||||||
|
Building translation key... [0.010s CPU, 0.006s wall-clock]
|
||||||
|
Computing fact groups: [0.360s CPU, 0.365s wall-clock]
|
||||||
|
Building STRIPS to SAS dictionary... [0.000s CPU, 0.002s wall-clock]
|
||||||
|
Building dictionary for full mutex groups... [0.000s CPU, 0.003s wall-clock]
|
||||||
|
Building mutex information...
|
||||||
|
Building mutex information: [0.010s CPU, 0.003s wall-clock]
|
||||||
|
Translating task...
|
||||||
|
Processing axioms...
|
||||||
|
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
|
||||||
|
Processing axioms: [0.140s CPU, 0.145s wall-clock]
|
||||||
|
Translating task: [3.010s CPU, 3.007s wall-clock]
|
||||||
|
0 effect conditions simplified
|
||||||
|
0 implied preconditions added
|
||||||
|
Detecting unreachable propositions...
|
||||||
|
0 operators removed
|
||||||
|
0 axioms removed
|
||||||
|
17 propositions removed
|
||||||
|
Detecting unreachable propositions: [1.620s CPU, 1.618s wall-clock]
|
||||||
|
Reordering and filtering variables...
|
||||||
|
17 of 17 variables necessary.
|
||||||
|
0 of 17 mutex groups necessary.
|
||||||
|
10532 of 10532 operators necessary.
|
||||||
|
0 of 0 axiom rules necessary.
|
||||||
|
Reordering and filtering variables: [0.410s CPU, 0.418s wall-clock]
|
||||||
|
Translator variables: 17
|
||||||
|
Translator derived variables: 0
|
||||||
|
Translator facts: 497
|
||||||
|
Translator goal facts: 15
|
||||||
|
Translator mutex groups: 0
|
||||||
|
Translator total mutex groups size: 0
|
||||||
|
Translator operators: 10532
|
||||||
|
Translator axioms: 0
|
||||||
|
Translator task size: 52739
|
||||||
|
Translator peak memory: 96908 KB
|
||||||
|
Writing output... [0.960s CPU, 1.044s wall-clock]
|
||||||
|
Done! [24.230s CPU, 24.319s wall-clock]
|
||||||
|
planner.py version 0.0.1
|
||||||
|
|
||||||
|
Time: 2.42s
|
||||||
|
Memory: 205MB
|
||||||
|
|
||||||
|
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.01s
|
||||||
|
Memory: 205MB (+0MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 0.01s
|
||||||
|
|
||||||
|
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: 205MB
|
||||||
|
Grounding... [('step', [1]), ('step', [2]), ('step', [3]), ('step', [4]), ('step', [5]), ('check', [5])]
|
||||||
|
Grounding Time: 0.81s
|
||||||
|
Memory: 205MB (+0MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.11s
|
||||||
|
Memory: 209MB (+4MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 1.35s
|
||||||
|
|
||||||
|
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: 213.0MB
|
||||||
|
Grounding... [('step', [6]), ('step', [7]), ('step', [8]), ('step', [9]), ('step', [10]), ('check', [10])]
|
||||||
|
Grounding Time: 0.71s
|
||||||
|
Memory: 220MB (+11MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 0.11s
|
||||||
|
Memory: 249MB (+29MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 1.25s
|
||||||
|
|
||||||
|
Iteration 4
|
||||||
|
Queue: [(3,15,0,True), (4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||||
|
Grounded Until: 10
|
||||||
|
Expected Memory: 289.0MB
|
||||||
|
Grounding... [('step', [11]), ('step', [12]), ('step', [13]), ('step', [14]), ('step', [15]), ('check', [15])]
|
||||||
|
Grounding Time: 0.93s
|
||||||
|
Memory: 279MB (+30MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 3.74s
|
||||||
|
Memory: 318MB (+39MB)
|
||||||
|
UNSAT
|
||||||
|
Iteration Time: 5.08s
|
||||||
|
|
||||||
|
Iteration 5
|
||||||
|
Queue: [(4,20,0,True), (5,25,0,True), (6,30,0,True)]
|
||||||
|
Grounded Until: 15
|
||||||
|
Expected Memory: 387.0MB
|
||||||
|
Grounding... [('step', [16]), ('step', [17]), ('step', [18]), ('step', [19]), ('step', [20]), ('check', [20])]
|
||||||
|
Grounding Time: 0.75s
|
||||||
|
Memory: 350MB (+32MB)
|
||||||
|
Unblocking actions...
|
||||||
|
Solving...
|
||||||
|
Solving Time: 18.08s
|
||||||
|
Memory: 544MB (+194MB)
|
||||||
|
SAT
|
||||||
|
Testing...
|
||||||
|
SERIALIZABLE
|
||||||
|
Testing Time: 1.96s
|
||||||
|
Memory: 544MB (+0MB)
|
||||||
|
Answer: 1
|
||||||
|
occurs(action(("drive","t0","l3","l5","level239","level2","level241")),1) occurs(action(("load","p6","t0","l3")),1) occurs(action(("drive","t0","l5","l8","level232","level7","level239")),2) occurs(action(("load","p7","t0","l5")),2) occurs(action(("load","p9","t0","l8")),3) occurs(action(("drive","t0","l8","l11","level227","level5","level232")),3) occurs(action(("load","p10","t0","l11")),4) occurs(action(("drive","t0","l11","l12","level220","level7","level227")),4) occurs(action(("drive","t0","l12","l14","level205","level15","level220")),5) occurs(action(("load","p12","t0","l14")),6) occurs(action(("load","p13","t0","l14")),6) occurs(action(("load","p2","t0","l14")),6) occurs(action(("load","p4","t0","l14")),6) occurs(action(("load","p5","t0","l14")),6) occurs(action(("drive","t0","l14","l10","level195","level10","level205")),6) occurs(action(("unload","p7","t0","l10")),7) occurs(action(("unload","p9","t0","l10")),7) occurs(action(("drive","t0","l10","l14","level185","level10","level195")),7) occurs(action(("drive","t0","l14","l0","level165","level20","level185")),8) occurs(action(("unload","p5","t0","l0")),9) occurs(action(("drive","t0","l0","l5","level164","level1","level165")),9) occurs(action(("drive","t0","l5","l3","level162","level2","level164")),10) occurs(action(("unload","p4","t0","l3")),11) occurs(action(("drive","t0","l3","l5","level160","level2","level162")),11) occurs(action(("drive","t0","l5","l9","level157","level3","level160")),12) occurs(action(("load","p8","t0","l9")),13) occurs(action(("drive","t0","l9","l6","level139","level18","level157")),13) occurs(action(("unload","p10","t0","l6")),14) occurs(action(("unload","p8","t0","l6")),14) occurs(action(("load","p0","t0","l6")),14) occurs(action(("load","p3","t0","l6")),14) occurs(action(("drive","t0","l6","l1","level119","level20","level139")),14) occurs(action(("load","p1","t0","l1")),15) occurs(action(("load","p11","t0","l1")),15) occurs(action(("load","p14","t0","l1")),15) occurs(action(("drive","t0","l1","l13","level107","level12","level119")),15) occurs(action(("unload","p12","t0","l13")),16) occurs(action(("unload","p2","t0","l13")),16) occurs(action(("unload","p6","t0","l13")),16) occurs(action(("drive","t0","l13","l2","level105","level2","level107")),16) occurs(action(("unload","p3","t0","l2")),17) occurs(action(("drive","t0","l2","l5","level80","level25","level105")),17) occurs(action(("unload","p0","t0","l5")),18) occurs(action(("unload","p11","t0","l5")),18) occurs(action(("unload","p14","t0","l5")),18) occurs(action(("drive","t0","l5","l8","level73","level7","level80")),18) occurs(action(("unload","p1","t0","l8")),19) occurs(action(("unload","p13","t0","l8")),19) occurs(action(("drive","t0","l8","l7","level48","level25","level73")),19) occurs(action(("drive","t0","l7","l9","level24","level24","level48")),20)
|
||||||
|
SATISFIABLE
|
||||||
|
|
||||||
|
Models : 1+
|
||||||
|
Calls : 5
|
||||||
|
Time : 29.465s (Solving: 21.79s 1st Model: 18.02s Unsat: 3.75s)
|
||||||
|
CPU Time : 29.364s
|
||||||
|
|
||||||
|
Choices : 29307 (Domain: 29303)
|
||||||
|
Conflicts : 10074 (Analyzed: 10072)
|
||||||
|
Restarts : 108 (Average: 93.26 Last: 70)
|
||||||
|
Model-Level : 257.0
|
||||||
|
Problems : 5 (Average Length: 12.00 Splits: 0)
|
||||||
|
Lemmas : 10072 (Deleted: 6683)
|
||||||
|
Binary : 60 (Ratio: 0.60%)
|
||||||
|
Ternary : 15 (Ratio: 0.15%)
|
||||||
|
Conflict : 10072 (Average Length: 12159.2 Ratio: 100.00%)
|
||||||
|
Loop : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Other : 0 (Average Length: 0.0 Ratio: 0.00%)
|
||||||
|
Backjumps : 10072 (Average: 1.99 Max: 165 Sum: 19995)
|
||||||
|
Executed : 10047 (Average: 1.95 Max: 165 Sum: 19655 Ratio: 98.30%)
|
||||||
|
Bounded : 25 (Average: 13.60 Max: 22 Sum: 340 Ratio: 1.70%)
|
||||||
|
|
||||||
|
Rules : 169251
|
||||||
|
Atoms : 169251
|
||||||
|
Bodies : 1 (Original: 0)
|
||||||
|
Tight : Yes
|
||||||
|
Variables : 209674 (Eliminated: 0 Frozen: 9329)
|
||||||
|
Constraints : 1170952 (Binary: 99.0% Ternary: 0.6% Other: 0.4%)
|
||||||
|
|
||||||
|
Memory Peak : 623MB
|
||||||
|
Max. Length : 20 steps
|
||||||
|
Sol. Length : 20 steps
|
||||||
|
Models : 1
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue
Block a user