Logic Progr 19030 pair #381919943

details

property	value
status	complete
benchmark	suffix-bf.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n077.star.cs.uiowa.edu
space	BCGGV05

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.71643686295 seconds
cpu usage	6.354301954
max memory	9.4337024E8

stage attributes

key	value
output-size	51015
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_standard /export/starexec/sandbox2/benchmark/theBenchmark.pl /export/starexec/sandbox2/output/output_files


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


MAYBE
proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


Left Termination of the query pattern

suffix(g,a)

w.r.t. the given Prolog program could not be shown:

(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 [SOUND, 0 ms]
    (8) QDP
(9) PrologToPiTRSProof [SOUND, 0 ms]
(10) PiTRS
    (11) DependencyPairsProof [EQUIVALENT, 0 ms]
    (12) PiDP
    (13) DependencyGraphProof [EQUIVALENT, 0 ms]
    (14) PiDP
    (15) UsableRulesProof [EQUIVALENT, 0 ms]
    (16) PiDP
    (17) PiDPToQDPProof [SOUND, 0 ms]
    (18) QDP
(19) PrologToTRSTransformerProof [SOUND, 0 ms]
(20) QTRS
    (21) DependencyPairsProof [EQUIVALENT, 0 ms]
    (22) QDP
    (23) DependencyGraphProof [EQUIVALENT, 0 ms]
    (24) QDP
    (25) MNOCProof [EQUIVALENT, 0 ms]
    (26) QDP
    (27) UsableRulesProof [EQUIVALENT, 0 ms]
    (28) QDP
    (29) QReductionProof [EQUIVALENT, 0 ms]
    (30) QDP
(31) PrologToIRSwTTransformerProof [SOUND, 0 ms]
(32) IRSwT
    (33) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
    (34) IRSwT
    (35) IntTRSCompressionProof [EQUIVALENT, 42 ms]
    (36) IRSwT
    (37) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
    (38) IRSwT
    (39) IRSwTTerminationDigraphProof [EQUIVALENT, 3 ms]
    (40) IRSwT
    (41) FilterProof [EQUIVALENT, 0 ms]
    (42) IntTRS
    (43) IntTRSPeriodicNontermProof [COMPLETE, 8 ms]
    (44) NO
(45) PrologToPiTRSProof [SOUND, 0 ms]
(46) PiTRS
    (47) DependencyPairsProof [EQUIVALENT, 0 ms]
    (48) PiDP
    (49) DependencyGraphProof [EQUIVALENT, 0 ms]
    (50) PiDP
    (51) UsableRulesProof [EQUIVALENT, 0 ms]
    (52) PiDP
    (53) PiDPToQDPProof [SOUND, 0 ms]
    (54) QDP


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

(0)
Obligation:
Clauses:

suffix(Xs, Ys) :- app(X1, Xs, Ys).
app([], X, X).
app(.(X, Xs), Ys, .(X, Zs)) :- app(Xs, Ys, Zs).


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

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

{
    "root": 2,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(suffix Xs Ys)",
                "(app X1 Xs Ys)"
            ],

popout

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

job log

popout

actions all output return to Logic Progr 19030