Logic Progr 19030 pair #381920211

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.64752292633 seconds
cpu usage	7.410488226
max memory	9.2422144E8

stage attributes

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


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

(0)
Obligation:
Clauses:

test_fun(X, Y) :- loop1(X, Y, 0).
loop1(X, Y, C) :- ','(>=(X, 0), ','(is(Y1, 1), loop2(X, Y1, C))).
loop1(X, Y, C) :- <(X, 0).
loop2(X, Y, C) :- ','(>(X, Y), ','(>(Y, 0), ','(is(Y1, *(2, Y)), ','(is(C1, +(C, 1)), loop2(X, Y1, C1))))).
loop2(X, Y, C) :- ','(=<(X, Y), ','(is(X1, -(X, 1)), loop1(X1, Y, C))).


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)",
                "(loop1 X Y (0))"
            ],
            [
                "(loop1 X Y C)",
                "(',' (>= X (0)) (',' (is Y1 (1)) (loop2 X Y1 C)))"
            ],
            [
                "(loop1 X Y C)",
                "(< X (0))"
            ],
            [
                "(loop2 X Y C)",
                "(',' (> X Y) (',' (> Y (0)) (',' (is Y1 (* (2) Y)) (',' (is C1 (+ C (1))) (loop2 X Y1 C1)))))"
            ],
            [
                "(loop2 X Y C)",
                "(',' (=< X Y) (',' (is X1 (- X (1))) (loop1 X1 Y C)))"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "22": {
                "goal": [],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": [],
                    "free": [],
                    "exprvars": []
                }
            },

popout

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

job log

popout

actions all output return to Logic Progr 19030