Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Logic Programming pair #487529085
details
property
value
status
complete
benchmark
map1.pl
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n151.star.cs.uiowa.edu
space
talp_apt
run statistics
property
value
solver
AProVE
configuration
standard
runtime (wallclock)
1.76487612724 seconds
cpu usage
3.951699131
max memory
2.69737984E8
stage attributes
key
value
output-size
15302
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_standard /export/starexec/sandbox/benchmark/theBenchmark.pl /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox/benchmark/theBenchmark.pl # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty Left Termination of the query pattern map(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 0 ms] (2) TRIPLES (3) TriplesToPiDPProof [SOUND, 0 ms] (4) PiDP (5) DependencyGraphProof [EQUIVALENT, 0 ms] (6) PiDP (7) PiDPToQDPProof [SOUND, 0 ms] (8) QDP (9) QDPSizeChangeProof [EQUIVALENT, 0 ms] (10) YES ---------------------------------------- (0) Obligation: Clauses: p(X, Y). map(.(X, Xs), .(Y, Ys)) :- ','(p(X, Y), map(Xs, Ys)). map([], []). Query: map(g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 3, "program": { "directives": [], "clauses": [ [ "(p X Y)", null ], [ "(map (. X Xs) (. Y Ys))", "(',' (p X Y) (map Xs Ys))" ], [ "(map ([]) ([]))", null ] ] }, "graph": { "nodes": { "89": { "goal": [ { "clause": 1, "scope": 1, "term": "(map T1 T2)" }, { "clause": 2, "scope": 1, "term": "(map T1 T2)" } ], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T1"], "free": [], "exprvars": [] } }, "160": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState",
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Logic Programming