details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.01225185394 seconds
cpu usage	5.043336081
max memory	5.164032E8

stage attributes

key	value
output-size	68647
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, 53 ms] (2) TRIPLES (3) TPisEmptyProof [EQUIVALENT, 0 ms] (4) YES ---------------------------------------- (0) Obligation: Clauses: test_fun(X, Y) :- ','(>(X, 0), ','(>(Y, 0), loop(X, Y, 0))). loop(X, Y, C) :- ','(=\=(X, 0), loop_body(X, Y, C)). loop(X, Y, C) :- =:=(X, 0). loop_body(X, Y, C) :- ','(>(X, Y), ','(is(X1, Y), ','(is(C1, +(C, 1)), loop(X1, Y, C1)))). loop_body(X, Y, C) :- ','(=<(X, Y), ','(>(X, 0), ','(is(X1, -(X, 1)), ','(is(C1, +(C, 1)), loop(X1, Y, C1))))). Query: test_fun(g,g) ---------------------------------------- (1) PrologToDTProblemTransformerProof (SOUND) Built DT problem from termination graph DT10. { "root": 3, "program": { "directives": [], "clauses": [ [ "(test_fun X Y)", "(',' (> X (0)) (',' (> Y (0)) (loop X Y (0))))" ], [ "(loop X Y C)", "(',' (=\\= X (0)) (loop_body X Y C))" ], [ "(loop X Y C)", "(=:= X (0))" ], [ "(loop_body X Y C)", "(',' (> X Y) (',' (is X1 Y) (',' (is C1 (+ C (1))) (loop X1 Y C1))))" ], [ "(loop_body X Y C)", "(',' (=< X Y) (',' (> X (0)) (',' (is X1 (- X (1))) (',' (is C1 (+ C (1))) (loop X1 Y C1)))))" ] ] }, "graph": { "nodes": { "3387": { "goal": [{ "clause": -1, "scope": -1, "term": "(loop T5 T6 (0))" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [ { "lhs": { "type": "PlainIntegerConstant", "value": "0" }, "type": "PlainIntegerRelation", "rhs": { "name": "T5", "type": "PlainIntegerVariable" }, "operation": "<" }, { "lhs": { "type": "PlainIntegerConstant", "value": "0" popout

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

job log

popout

actions

all output return to Logic Progr 19030