Logic Progr 19030 pair #381919651

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.65630698204 seconds
cpu usage	7.036958769
max memory	4.49482752E8

stage attributes

key	value
output-size	45102
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) PrologToIRSwTTransformerProof [SOUND, 39 ms]
(2) IRSwT
(3) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 19 ms]
(6) IRSwT
(7) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(8) IRSwT
(9) IRSwTTerminationDigraphProof [EQUIVALENT, 5 ms]
(10) IRSwT
(11) IntTRSCompressionProof [EQUIVALENT, 1 ms]
(12) IRSwT
(13) TempFilterProof [SOUND, 39 ms]
(14) IntTRS
(15) RankingReductionPairProof [EQUIVALENT, 26 ms]
(16) YES


----------------------------------------

(0)
Obligation:
Clauses:

test_fun(X, Y) :- ','(>(X, 0), loop(X, Y)).
loop(X, Y) :- ','(>(X, Y), ','(>(X, 0), ','(is(Y1, +(Y, X)), loop(X, Y1)))).
loop(X, Y) :- =<(X, Y).


Query: test_fun(g,g)
----------------------------------------

(1) PrologToIRSwTTransformerProof (SOUND)
Transformed Prolog program to IRSwT according to method in Master Thesis of A. Weinert

{
    "root": 3,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(test_fun X Y)",
                "(',' (> X (0)) (loop X Y))"
            ],
            [
                "(loop X Y)",
                "(',' (> X Y) (',' (> X (0)) (',' (is Y1 (+ Y X)) (loop X Y1))))"
            ],
            [
                "(loop X Y)",
                "(=< X Y)"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "11": {
                "goal": [],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": [],
                    "free": [],
                    "exprvars": []
                }
            },
            "type": "Nodes",
            "1921": {
                "goal": [{
                    "clause": 1,
                    "scope": 2,
                    "term": "(loop T7 T8)"
                }],
                "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