details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.16985011101 seconds
cpu usage	5.448900731
max memory	5.29453056E8

stage attributes

key	value
output-size	130180
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, 79 ms] (2) TRIPLES (3) TPisEmptyProof [EQUIVALENT, 0 ms] (4) YES ---------------------------------------- (0) Obligation: Clauses: test_fun(X, Y) :- loop(X, Y, 0). loop(X, Y, C) :- ','(=\=(X, Y), loop_body(X, Y, C)). loop(X, Y, C) :- =:=(X, Y). loop_body(X, Y, C) :- ','(>(X, Y), ','(!, ','(is(Y1, +(Y, 1)), ','(is(C1, +(C, 1)), loop(X, Y1, C1))))). loop_body(X, Y, C) :- ','(=<(X, Y), ','(!, ','(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)", "(loop X Y (0))" ], [ "(loop X Y C)", "(',' (=\\= X Y) (loop_body X Y C))" ], [ "(loop X Y C)", "(=:= X Y)" ], [ "(loop_body X Y C)", "(',' (> X Y) (',' (!) (',' (is Y1 (+ Y (1))) (',' (is C1 (+ C (1))) (loop X Y1 C1)))))" ], [ "(loop_body X Y C)", "(',' (=< X Y) (',' (!) (',' (is X1 (+ X (1))) (',' (is C1 (+ C (1))) (loop X1 Y C1)))))" ] ] }, "graph": { "nodes": { "3266": { "goal": [{ "clause": -1, "scope": -1, "term": "(true)" }], "kb": { "nonunifying": [], "intvars": {}, "arithmetic": { "type": "PlainIntegerRelationState", "relations": [{ "lhs": { "name": "T97", "type": "PlainIntegerVariable" }, "type": "PlainIntegerRelation", "rhs": { "name": "T98", "type": "PlainIntegerVariable" }, "operation": "=" }] }, "ground": [ "T97", "T98" ], popout

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

job log

popout

actions

all output return to Logic Progr 19030