Logic Programming pair #487096512

details

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

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.29815 seconds
cpu usage	5.9497
user time	5.60158
system time	0.348123
max virtual memory	1.920988E7
max residence set size	747892.0

stage attributes

key	value
starexec-result	MAYBE

output

MAYBE
proof of /export/starexec/sandbox2/benchmark/theBenchmark.pl
# AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty


Left Termination of the query pattern

minimum(a,g)

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

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


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

(0)
Obligation:
Clauses:

minimum(tree(X, void, X1), X).
minimum(tree(X2, Left, X3), X) :- minimum(Left, X).


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

(1) PrologToTRSTransformerProof (SOUND)
Transformed Prolog program to TRS.

{
    "root": 1,
    "program": {
        "directives": [],
        "clauses": [
            [
                "(minimum (tree X (void) X1) X)",
                null
            ],
            [
                "(minimum (tree X2 Left X3) X)",
                "(minimum Left X)"
            ]
        ]
    },
    "graph": {

popout

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

job log

popout

actions all output return to Logic Programming