details

property	value
status	complete
benchmark	duplicate.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n078.star.cs.uiowa.edu
space	talp_dds

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.74091506004 seconds
cpu usage	3.978741398
max memory	1.987584E8

stage attributes

key	value
output-size	16792
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: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern duplicate(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: duplicate([], []). duplicate(.(X, Y), .(X, .(X, Z))) :- duplicate(Y, Z). Query: duplicate(g,a) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 15, "program": { "directives": [], "clauses": [ [ "(duplicate ([]) ([]))", null ], [ "(duplicate (. X Y) (. X (. X Z)))", "(duplicate Y Z)" ] ] }, "graph": { "nodes": { "77": { "goal": [{ "clause": -1, "scope": -1, "term": "(duplicate T7 T9)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T7"], "free": [], "exprvars": [] } }, "88": { "goal": [], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [], "free": [], "exprvars": [] } }, "23": { "goal": [ { "clause": 0, "scope": 1, popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Logic Progr 19030