Logic Progr 19030 pair #381920065

details

property	value
status	complete
benchmark	svcomp-even-odd-01-true-unrech-call-true-termination-modified-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)	1.8440220356 seconds
cpu usage	4.44666296
max memory	3.1762432E8

stage attributes

key	value
output-size	61075
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

main(g)

w.r.t. the given Prolog program could successfully be proven:

(0) Prolog
(1) PrologToIRSwTTransformerProof [SOUND, 8 ms]
(2) TRUE


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

(0)
Obligation:
Clauses:

main(N) :- ','(>=(N, 0), isOdd(N)).
isOdd(1).
isOdd(N) :- ','(>(N, 1), ','(is(N1, -(N, 1)), isEven(N1))).
isEven(0).
isEven(N) :- ','(>(N, 1), ','(is(N1, -(N, 1)), isOdd(N1))).


Query: main(g)
----------------------------------------

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

{
    "root": 3,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(main N)",
                "(',' (>= N (0)) (isOdd N))"
            ],
            [
                "(isOdd (1))",
                null
            ],
            [
                "(isOdd N)",
                "(',' (> N (1)) (',' (is N1 (- N (1))) (isEven N1)))"
            ],
            [
                "(isEven (0))",
                null
            ],
            [
                "(isEven N)",
                "(',' (> N (1)) (',' (is N1 (- N (1))) (isOdd N1)))"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "1909": {
                "goal": [],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": [
                            {
                                "lhs": {
                                    "type": "PlainIntegerConstant",
                                    "value": "0"
                                },
                                "type": "PlainIntegerRelation",
                                "rhs": {
                                    "name": "T4",
                                    "type": "PlainIntegerVariable"
                                },
                                "operation": "<="
                            },
                            {
                                "lhs": {
                                    "name": "T7",
                                    "type": "PlainIntegerVariable"
                                },
                                "type": "PlainIntegerRelation",
                                "rhs": {
                                    "name": "T4",
                                    "type": "PlainIntegerVariable"
                                },

popout

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

job log

popout

actions all output return to Logic Progr 19030