Logic Progr 19030 pair #381919678

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.73756694794 seconds
cpu usage	3.851107442
max memory	2.59760128E8

stage attributes

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

q(g)

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

(0) Prolog
(1) PrologToDTProblemTransformerProof [SOUND, 0 ms]
(2) TRIPLES
(3) TriplesToPiDPProof [SOUND, 0 ms]
(4) PiDP
(5) DependencyGraphProof [EQUIVALENT, 0 ms]
(6) PiDP
(7) PiDPToQDPProof [EQUIVALENT, 0 ms]
(8) QDP
(9) QDPSizeChangeProof [EQUIVALENT, 0 ms]
(10) YES


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

(0)
Obligation:
Clauses:

q(X) :- ','(not_zero(X), ','(p(X, Y), q(Y))).
p(0, 0).
p(s(X), X).
zero(0).
not_zero(X) :- ','(zero(X), ','(!, failure(a))).
not_zero(X1).
failure(b).


Query: q(g)
----------------------------------------

(1) PrologToDTProblemTransformerProof (SOUND)
Built DT problem from termination graph DT10.

{
    "root": 1,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(q X)",
                "(',' (not_zero X) (',' (p X Y) (q Y)))"
            ],
            [
                "(p (0) (0))",
                null
            ],
            [
                "(p (s X) X)",
                null
            ],
            [
                "(zero (0))",
                null
            ],
            [
                "(not_zero X)",
                "(',' (zero X) (',' (!) (failure (a))))"
            ],
            [
                "(not_zero X1)",
                null
            ],
            [
                "(failure (b))",
                null
            ]
        ]
    },
    "graph": {
        "nodes": {
            "33": {
                "goal": [
                    {
                        "clause": 4,
                        "scope": 2,
                        "term": "(',' (not_zero T3) (',' (p T3 X4) (q X4)))"
                    },
                    {
                        "clause": 5,
                        "scope": 2,
                        "term": "(',' (not_zero T3) (',' (p T3 X4) (q X4)))"
                    }

popout

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

job log

popout

actions all output return to Logic Progr 19030