Logic Progr 19030 pair #381919966

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.88837099075 seconds
cpu usage	8.123964342
max memory	4.55835648E8

stage attributes

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

iterate(g)

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

(0) Prolog
(1) PrologToIRSwTTransformerProof [SOUND, 45 ms]
(2) IRSwT
(3) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
(4) IRSwT
(5) IntTRSCompressionProof [EQUIVALENT, 31 ms]
(6) IRSwT
(7) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
(8) IRSwT
(9) IRSwTTerminationDigraphProof [EQUIVALENT, 37 ms]
(10) IRSwT
(11) IntTRSCompressionProof [EQUIVALENT, 0 ms]
(12) IRSwT
(13) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 1 ms]
(14) IRSwT
(15) TempFilterProof [SOUND, 36 ms]
(16) IntTRS
(17) PolynomialOrderProcessor [EQUIVALENT, 13 ms]
(18) YES


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

(0)
Obligation:
Clauses:

iterate(Bound) :- loop(Bound, 0, 0).
loop(Bound, I, Sum) :- ','(<(I, Bound), ','(is(Sum1, +(Sum, I)), ','(is(I1, +(I, 1)), loop(Bound, I1, Sum1)))).
loop(Bound, I, Sum) :- >=(I, Bound).


Query: iterate(g)
----------------------------------------

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

{
    "root": 5,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(iterate Bound)",
                "(loop Bound (0) (0))"
            ],
            [
                "(loop Bound I Sum)",
                "(',' (< I Bound) (',' (is Sum1 (+ Sum I)) (',' (is I1 (+ I (1))) (loop Bound I1 Sum1))))"
            ],
            [
                "(loop Bound I Sum)",
                "(>= I Bound)"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "22": {
                "goal": [],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": [],
                    "free": [],
                    "exprvars": []
                }
            },
            "1186": {
                "goal": [
                    {
                        "clause": 1,
                        "scope": 3,
                        "term": "(loop T11 T13 T12)"
                    },
                    {
                        "clause": 2,
                        "scope": 3,

popout

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

job log

popout

actions all output return to Logic Progr 19030