Logic Progr 19030 pair #381919656

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.62236690521 seconds
cpu usage	3.68741502
max memory	2.35061248E8

stage attributes

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

p(a,a,a)

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

(0) Prolog
(1) BuiltinConflictTransformerProof [EQUIVALENT, 0 ms]
(2) Prolog
(3) PrologToIRSwTTransformerProof [SOUND, 0 ms]
(4) TRUE


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

(0)
Obligation:
Clauses:

p(X, Y, Z) :- ','(=(X, Y), ','(=(Z, 1), !)).
p(X, Y, Z) :- ','(=(Z, 1), ','(=(Y, X), p(X, Y, Z))).
=(X, X).


Query: p(a,a,a)
----------------------------------------

(1) BuiltinConflictTransformerProof (EQUIVALENT)
Renamed defined predicates conflicting with built-in predicates [PROLOG].
----------------------------------------

(2)
Obligation:
Clauses:

p(X, Y, Z) :- ','(user_defined_=(X, Y), ','(user_defined_=(Z, 1), !)).
p(X, Y, Z) :- ','(user_defined_=(Z, 1), ','(user_defined_=(Y, X), p(X, Y, Z))).
user_defined_=(X, X).


Query: p(a,a,a)
----------------------------------------

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

{
    "root": 10,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(p X Y Z)",
                "(',' (user_defined_= X Y) (',' (user_defined_= Z (1)) (!)))"
            ],
            [
                "(p X Y Z)",
                "(',' (user_defined_= Z (1)) (',' (user_defined_= Y X) (p X Y Z)))"
            ],
            [
                "(user_defined_= X X)",
                null
            ]
        ]
    },
    "graph": {
        "nodes": {
            "type": "Nodes",
            "131": {
                "goal": [
                    {
                        "clause": -1,
                        "scope": -1,
                        "term": "(',' (user_defined_= T16 T17) (',' (user_defined_= T18 (1)) (!_1)))"
                    },
                    {
                        "clause": 1,
                        "scope": 1,
                        "term": "(p T1 T2 T3)"
                    }
                ],
                "kb": {
                    "nonunifying": [],
                    "intvars": {},
                    "arithmetic": {
                        "type": "PlainIntegerRelationState",
                        "relations": []
                    },
                    "ground": [],

popout

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

job log

popout

actions all output return to Logic Progr 19030