details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	4.83530092239 seconds
cpu usage	15.422695245
max memory	1.749766144E9

stage attributes

key	value
output-size	32113
starexec-result	YES

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty Left Termination of the query pattern decode(g,a) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 21 ms] (2) IRSwT (3) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (4) IRSwT (5) IntTRSCompressionProof [EQUIVALENT, 58 ms] (6) IRSwT (7) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (8) IRSwT (9) IRSwTTerminationDigraphProof [EQUIVALENT, 41 ms] (10) IRSwT (11) IntTRSCompressionProof [EQUIVALENT, 0 ms] (12) IRSwT (13) TempFilterProof [SOUND, 172 ms] (14) IRSwT (15) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] (16) IRSwT (17) IRSwTOrderProof [EQUIVALENT, 15 ms] (18) YES ---------------------------------------- (0) Obligation: Clauses: decode([], []). decode(.(X, Ys), .(X, Zs)) :- ','(\+(is_list(X)), decode(Ys, Zs)). decode(.(.(1, .(X, [])), Ys), .(X, Zs)) :- decode(Ys, Zs). decode(.(.(N, .(X, [])), Ys), .(X, Zs)) :- ','(>(N, 1), ','(is(N1, -(N, 1)), decode(.(.(N1, .(X, [])), Ys), Zs))). Query: decode(g,a) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 3, "program": { "directives": [], "clauses": [ [ "(decode ([]) ([]))", null ], [ "(decode (. X Ys) (. X Zs))", "(',' (\\+ (is_list X)) (decode Ys Zs))" ], [ "(decode (. (. (1) (. X ([]))) Ys) (. X Zs))", "(decode Ys Zs)" ], [ "(decode (. (. N (. X ([]))) Ys) (. X Zs))", "(',' (> N (1)) (',' (is N1 (- N (1))) (decode (. (. N1 (. X ([]))) Ys) Zs)))" ] ] }, "graph": { "nodes": { "46": { "goal": [{ "clause": 2, "scope": 1, "term": "(decode T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": ["T1"], "free": [], "exprvars": [] } }, "25": { popout

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

job log

popout

actions

all output return to Logic Progr 19030