Logic Progr 19030 pair #381919833

details

property	value
status	complete
benchmark	sumrecursive.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n026.star.cs.uiowa.edu
space	Weinert_15

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.96070599556 seconds
cpu usage	8.750774942
max memory	6.91294208E8

stage attributes

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

sum(a,g,g)

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

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


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

(0)
Obligation:
Clauses:

sum(X, Y, Z) :- ','(=:=(X, 0), is(Z, Y)).
sum(X, Y, Z) :- ','(<(X, 0), sum(+(X, 1), -(Y, 1), Z)).
sum(X, Y, Z) :- ','(>(X, 0), sum(-(X, 1), +(Y, 1), Z)).


Query: sum(a,g,g)
----------------------------------------

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

{
    "root": 1,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(sum X Y Z)",
                "(',' (=:= X (0)) (is Z Y))"
            ],
            [
                "(sum X Y Z)",
                "(',' (< X (0)) (sum (+ X (1)) (- Y (1)) Z))"
            ],
            [
                "(sum X Y Z)",
                "(',' (> X (0)) (sum (- X (1)) (+ Y (1)) Z))"
            ]
        ]
    },
    "graph": {
        "nodes": {
            "type": "Nodes",
            "1932": {
                "goal": [{
                    "clause": -1,
                    "scope": -1,
                    "term": "(',' (< (+ (- T158 (1)) (1)) (0)) (sum (+ (+ (- T158 (1)) (1)) (1)) (- (- (+ T159 (1)) (1)) (1)) T160))"
                }],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": [
                            {
                                "lhs": {
                                    "type": "PlainIntegerConstant",
                                    "value": "0"
                                },
                                "type": "PlainIntegerRelation",
                                "rhs": {
                                    "name": "T93",
                                    "type": "PlainIntegerVariable"
                                },
                                "operation": "<"

popout

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

job log

popout

actions all output return to Logic Progr 19030