details

property	value
status	complete
benchmark	svcomp-java-ag313-c.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n052.star.cs.uiowa.edu
space	AProVE_numeric

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.7752840519 seconds
cpu usage	4.195377668
max memory	3.38599936E8

stage attributes

key	value
output-size	21434
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 test_fun(g,g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 62 ms] (2) TRIPLES (3) TPisEmptyProof [EQUIVALENT, 0 ms] (4) YES ---------------------------------------- (0) Obligation: Clauses: test_fun(X, Y) :- ','(=\=(X, 0), loop(X, Y, 0)). loop(X, Y, I) :- ','(>(X, 0), ','(>(Y, 0), ','(is(I1, +(I, 1)), ','(is(X1, -(-(X, 1), -(Y, 1))), loop(X1, Y, I1))))). loop(X, Y, I) :- =<(X, 0). loop(X, Y, I) :- =<(Y, 0). Query: test_fun(g,g) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 1, "program": { "directives": [], "clauses": [ [ "(test_fun X Y)", "(',' (=\\= X (0)) (loop X Y (0)))" ], [ "(loop X Y I)", "(',' (> X (0)) (',' (> Y (0)) (',' (is I1 (+ I (1))) (',' (is X1 (- (- X (1)) (- Y (1)))) (loop X1 Y I1)))))" ], [ "(loop X Y I)", "(=< X (0))" ], [ "(loop X Y I)", "(=< Y (0))" ] ] }, "graph": { "nodes": { "type": "Nodes", "1": { "goal": [{ "clause": -1, "scope": -1, "term": "(test_fun T1 T2)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [] }, "ground": [ "T1", "T2" ], "free": [], "exprvars": [] } }, "2503": { "goal": [{ "clause": 3, "scope": 2, "term": "(loop T5 T6 (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