Logic Progr 19030 pair #381920222

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.07809114456 seconds
cpu usage	8.482458068
max memory	7.03361024E8

stage attributes

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

goal(g)

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

(0) Prolog
(1) PrologToIRSwTTransformerProof [SOUND, 114 ms]
(2) AND
    (3) IRSwT
        (4) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
        (5) TRUE
    (6) IRSwT
        (7) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
        (8) IRSwT
        (9) IntTRSCompressionProof [EQUIVALENT, 28 ms]
        (10) IRSwT
        (11) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
        (12) IRSwT
        (13) IRSwTTerminationDigraphProof [EQUIVALENT, 6 ms]
        (14) IRSwT
        (15) TempFilterProof [SOUND, 1 ms]
        (16) IRSwT
        (17) IRSwTToQDPProof [SOUND, 0 ms]
        (18) QDP
        (19) QDPSizeChangeProof [EQUIVALENT, 0 ms]
        (20) YES


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

(0)
Obligation:
Clauses:

goal(X) :- ','(s2t(X, T), tappend(T, X1, X2)).
tappend(nil, Y, Z) :- ','(!, eq(Y, Z)).
tappend(T, T1, node(T1, X, T2)) :- ','(left(T, nil), ','(right(T, T2), value(T, X))).
tappend(T, T2, node(T1, X, T2)) :- ','(left(T, T1), ','(right(T, nil), value(T, X))).
tappend(T, T3, node(U, X, T2)) :- ','(left(T, T1), ','(right(T, T2), ','(value(T, X), tappend(T1, T3, U)))).
tappend(T, T1, node(T1, X, U)) :- ','(left(T, T1), ','(right(T, T2), ','(value(T, X), tappend(T2, T3, U)))).
s2t(0, L) :- ','(!, eq(L, nil)).
s2t(X, node(T, X3, T)) :- ','(p(X, P), s2t(P, T)).
s2t(X, node(nil, X4, T)) :- ','(p(X, P), s2t(P, T)).
s2t(X, node(T, X5, nil)) :- ','(p(X, P), s2t(P, T)).
s2t(X, node(nil, X6, nil)).
left(nil, nil).
left(node(L, X7, X8), L).
right(nil, nil).
right(node(X9, X10, R), R).
value(nil, nil).
value(node(X11, X, X12), X).
p(0, 0).
p(s(X), X).
eq(X, X).


Query: goal(g)
----------------------------------------

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

{
    "root": 2,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(goal X)",
                "(',' (s2t X T) (tappend T X1 X2))"
            ],
            [
                "(tappend (nil) Y Z)",
                "(',' (!) (eq Y Z))"
            ],
            [
                "(tappend T T1 (node T1 X T2))",
                "(',' (left T (nil)) (',' (right T T2) (value T X)))"
            ],
            [
                "(tappend T T2 (node T1 X T2))",
                "(',' (left T T1) (',' (right T (nil)) (value T X)))"
            ],
            [
                "(tappend T T3 (node U X T2))",
                "(',' (left T T1) (',' (right T T2) (',' (value T X) (tappend T1 T3 U))))"
            ],
            [

popout

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

job log

popout

actions all output return to Logic Progr 19030