details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.07617497444 seconds
cpu usage	5.316483158
max memory	5.19376896E8

stage attributes

key	value
output-size	118832
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 test_fun(g,g) w.r.t. the given Prolog program could successfully be proven: (0) Prolog (1) PrologToDTProblemTransformerProof [SOUND, 48 ms] (2) TRIPLES (3) TPisEmptyProof [EQUIVALENT, 0 ms] (4) YES ---------------------------------------- (0) Obligation: Clauses: test_fun(X, Y) :- loop1(X, Y, 0). loop1(X, Y, C) :- ','(=:=(X, Y), ','(>(X, 0), loop2(X, Y, C))). loop1(X, Y, C) :- =\=(X, Y). loop1(X, Y, C) :- =<(X, 0). loop2(X, Y, C) :- ','(>(Y, 0), ','(is(X1, -(X, 1)), ','(is(Y1, -(Y, 1)), ','(is(C1, +(C, 1)), loop2(X1, Y1, C1))))). loop2(X, Y, C) :- ','(=<(Y, 0), loop1(X, Y, C)). Query: test_fun(g,g) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 4, "program": { "directives": [], "clauses": [ [ "(test_fun X Y)", "(loop1 X Y (0))" ], [ "(loop1 X Y C)", "(',' (=:= X Y) (',' (> X (0)) (loop2 X Y C)))" ], [ "(loop1 X Y C)", "(=\\= X Y)" ], [ "(loop1 X Y C)", "(=< X (0))" ], [ "(loop2 X Y C)", "(',' (> Y (0)) (',' (is X1 (- X (1))) (',' (is Y1 (- Y (1))) (',' (is C1 (+ C (1))) (loop2 X1 Y1 C1)))))" ], [ "(loop2 X Y C)", "(',' (=< Y (0)) (loop1 X Y C))" ] ] }, "graph": { "nodes": { "3280": { "goal": [{ "clause": -1, "scope": -1, "term": "(',' (is X48 (- T27 (1))) (',' (is X49 (- T28 (1))) (',' (is X50 (+ (0) (1))) (loop2 X48 X49 X50))))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [ { "lhs": { "name": "T15", "type": "PlainIntegerVariable" }, "type": "PlainIntegerRelation", "rhs": { "name": "T16", "type": "PlainIntegerVariable" }, "operation": "=" popout

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

job log

popout

actions

all output return to Logic Progr 19030