details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.40071797371 seconds
cpu usage	6.102787286
max memory	4.31210496E8

stage attributes

key	value
output-size	20533
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 coprime(g,g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToIRSwTTransformerProof [SOUND, 32 ms] (2) IRSwT (3) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms] (4) IRSwT (5) IntTRSCompressionProof [EQUIVALENT, 26 ms] (6) IRSwT (7) IRSFormatTransformerProof [EQUIVALENT, 0 ms] (8) IRSwT (9) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms] (10) TRUE ---------------------------------------- (0) Obligation: Clauses: coprime(X, Y) :- gcd(X, Y, 1). gcd(X, 0, X) :- >(X, 0). gcd(X, Y, G) :- ','(>(Y, 0), ','(is(Z, mod(X, Y)), gcd(Y, Z, G))). Query: coprime(g,g) ---------------------------------------- (1) PrologToIRSwTTransformerProof (SOUND) Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert { "root": 3, "program": { "directives": [], "clauses": [ [ "(coprime X Y)", "(gcd X Y (1))" ], [ "(gcd X (0) X)", "(> X (0))" ], [ "(gcd X Y G)", "(',' (> Y (0)) (',' (is Z (mod X Y)) (gcd Y Z G)))" ] ] }, "graph": { "nodes": { "22": { "goal": [{ "clause": 2, "scope": 2, "term": "(gcd T8 T9 (1))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [ "T8", "T9" ], "free": [], "exprvars": [] } }, "23": { "goal": [{ "clause": -1, "scope": -1, "term": "(> (1) (0))" }], "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 Progr 19030