Logic Progr 19030 pair #381920061

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.58440208435 seconds
cpu usage	10.77683188
max memory	1.304178688E9

stage attributes

key	value
output-size	172775
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, 64 ms]
(2) IRSwT
(3) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 36 ms]
(6) IRSwT
(7) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(8) IRSwT
(9) IRSwTTerminationDigraphProof [EQUIVALENT, 46 ms]
(10) IRSwT
(11) IntTRSCompressionProof [EQUIVALENT, 1 ms]
(12) IRSwT
(13) TempFilterProof [SOUND, 34 ms]
(14) IntTRS
(15) PolynomialOrderProcessor [EQUIVALENT, 0 ms]
(16) YES


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

(0)
Obligation:
Clauses:

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