Logic Progr 19030 pair #381919829

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	1.8805000782 seconds
cpu usage	4.512033041
max memory	3.93752576E8

stage attributes

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

less(g,a)

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

(0) Prolog
(1) BuiltinConflictTransformerProof [EQUIVALENT, 0 ms]
(2) Prolog
(3) PrologToDTProblemTransformerProof [SOUND, 0 ms]
(4) TRIPLES
(5) TriplesToPiDPProof [SOUND, 0 ms]
(6) PiDP
(7) DependencyGraphProof [EQUIVALENT, 0 ms]
(8) AND
    (9) PiDP
        (10) PiDPToQDPProof [EQUIVALENT, 6 ms]
        (11) QDP
        (12) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (13) YES
    (14) PiDP
        (15) PiDPToQDPProof [EQUIVALENT, 0 ms]
        (16) QDP
        (17) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (18) YES
    (19) PiDP
        (20) PiDPToQDPProof [SOUND, 0 ms]
        (21) QDP
        (22) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (23) YES


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

(0)
Obligation:
Clauses:

less(0, Y) :- ','(!, =(Y, s(X2))).
less(X, Y) :- ','(p(X, X1), ','(p(Y, Y1), less(X1, Y1))).
p(0, 0).
p(s(X), X).
=(X, X).


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

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

(2)
Obligation:
Clauses:

less(0, Y) :- ','(!, user_defined_=(Y, s(X2))).
less(X, Y) :- ','(p(X, X1), ','(p(Y, Y1), less(X1, Y1))).
p(0, 0).
p(s(X), X).
user_defined_=(X, X).


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

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

{
    "root": 1,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(less (0) Y)",
                "(',' (!) (user_defined_= Y (s X2)))"
            ],
            [
                "(less X Y)",
                "(',' (p X X1) (',' (p Y Y1) (less X1 Y1)))"
            ],
            [
                "(p (0) (0))",
                null
            ],
            [
                "(p (s X) X)",
                null

popout

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

job log

popout

actions all output return to Logic Progr 19030