Logic Progr 19030 pair #381919695

details

property	value
status	complete
benchmark	svcomp-c-02-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)	3.42845702171 seconds
cpu usage	9.721876385
max memory	7.6740608E8

stage attributes

key	value
output-size	448182
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, 103 ms]
(2) AND
    (3) IRSwT
        (4) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 2 ms]
        (5) IRSwT
        (6) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (7) IRSwT
        (8) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (9) IRSwT
        (10) IRSwTTerminationDigraphProof [EQUIVALENT, 36 ms]
        (11) IRSwT
        (12) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (13) IRSwT
        (14) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
        (15) IRSwT
        (16) TempFilterProof [SOUND, 35 ms]
        (17) IntTRS
        (18) PolynomialOrderProcessor [EQUIVALENT, 14 ms]
        (19) YES
    (20) IRSwT
        (21) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
        (22) IRSwT
        (23) IntTRSCompressionProof [EQUIVALENT, 0 ms]
        (24) IRSwT
        (25) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (26) IRSwT
        (27) IRSwTTerminationDigraphProof [EQUIVALENT, 9 ms]
        (28) TRUE


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

(0)
Obligation:
Clauses:

test_fun(X, Y) :- loop1(X, Y, 0).
loop1(X, Y, C) :- ','(>=(X, 0), ','(is(X1, +(X, 1)), ','(is(Y1, 1), loop2(X1, Y1, C)))).
loop1(X, Y, C) :- <(X, 0).
loop2(X, Y, C) :- ','(>(X, Y), ','(is(Y1, +(Y, 1)), ','(is(C1, +(C, 1)), loop2(X, Y1, C1)))).
loop2(X, Y, C) :- ','(=<(X, Y), ','(is(X1, -(X, 2)), 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": 4,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(test_fun X Y)",
                "(loop1 X Y (0))"
            ],
            [
                "(loop1 X Y C)",
                "(',' (>= X (0)) (',' (is X1 (+ X (1))) (',' (is Y1 (1)) (loop2 X1 Y1 C))))"
            ],
            [
                "(loop1 X Y C)",
                "(< X (0))"
            ],
            [
                "(loop2 X Y C)",
                "(',' (> X Y) (',' (is Y1 (+ Y (1))) (',' (is C1 (+ C (1))) (loop2 X Y1 C1))))"
            ],
            [
                "(loop2 X Y C)",
                "(',' (=< X Y) (',' (is X1 (- X (2))) (loop1 X1 Y C)))"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "22": {
                "goal": [{
                    "clause": 2,
                    "scope": 2,

popout

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

job log

popout

actions all output return to Logic Progr 19030