Logic Programming pair #487096598

details

property	value
status	complete
benchmark	flat-oi.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	talp_mixed

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.76548 seconds
cpu usage	7.46602
user time	6.98727
system time	0.478751
max virtual memory	1.9276664E7
max residence set size	1054672.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

flat(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) UsableRulesProof [EQUIVALENT, 0 ms]
    (8) QDP
    (9) UsableRulesReductionPairsProof [EQUIVALENT, 3 ms]
    (10) QDP
    (11) NonTerminationLoopProof [COMPLETE, 0 ms]
    (12) NO
(13) PrologToPiTRSProof [SOUND, 0 ms]
(14) PiTRS
    (15) DependencyPairsProof [EQUIVALENT, 3 ms]
    (16) PiDP
    (17) DependencyGraphProof [EQUIVALENT, 0 ms]
    (18) PiDP
    (19) UsableRulesProof [EQUIVALENT, 0 ms]
    (20) PiDP
    (21) PiDPToQDPProof [SOUND, 1 ms]
    (22) QDP
    (23) UsableRulesReductionPairsProof [EQUIVALENT, 8 ms]
    (24) QDP
    (25) DependencyGraphProof [EQUIVALENT, 0 ms]
    (26) QDP
    (27) UsableRulesProof [EQUIVALENT, 0 ms]
    (28) QDP
    (29) QReductionProof [EQUIVALENT, 0 ms]
    (30) QDP
    (31) NonTerminationLoopProof [COMPLETE, 0 ms]
    (32) NO
(33) PrologToPiTRSProof [SOUND, 0 ms]
(34) PiTRS
    (35) DependencyPairsProof [EQUIVALENT, 0 ms]
    (36) PiDP
    (37) DependencyGraphProof [EQUIVALENT, 0 ms]
    (38) PiDP
    (39) UsableRulesProof [EQUIVALENT, 0 ms]
    (40) PiDP
    (41) PiDPToQDPProof [SOUND, 11 ms]
    (42) QDP
    (43) UsableRulesReductionPairsProof [EQUIVALENT, 8 ms]
    (44) QDP
    (45) DependencyGraphProof [EQUIVALENT, 0 ms]
    (46) QDP
    (47) UsableRulesProof [EQUIVALENT, 0 ms]
    (48) QDP
    (49) QReductionProof [EQUIVALENT, 0 ms]
    (50) QDP
    (51) NonTerminationLoopProof [COMPLETE, 0 ms]
    (52) NO
(53) PrologToDTProblemTransformerProof [SOUND, 0 ms]
(54) TRIPLES
    (55) TriplesToPiDPProof [SOUND, 0 ms]
    (56) PiDP
    (57) DependencyGraphProof [EQUIVALENT, 0 ms]
    (58) PiDP
    (59) PiDPToQDPProof [SOUND, 0 ms]
    (60) QDP
    (61) MRRProof [EQUIVALENT, 0 ms]
    (62) QDP
    (63) NonTerminationLoopProof [COMPLETE, 0 ms]
    (64) NO
(65) PrologToIRSwTTransformerProof [SOUND, 0 ms]
(66) IRSwT
    (67) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
    (68) IRSwT
    (69) IntTRSCompressionProof [EQUIVALENT, 23 ms]
    (70) IRSwT
    (71) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
    (72) IRSwT
    (73) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
    (74) IRSwT
    (75) IntTRSUnneededArgumentFilterProof [EQUIVALENT, 0 ms]
    (76) IRSwT


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

(0)
Obligation:
Clauses:

right(tree(X, XS1, XS2), XS2).
flat(niltree, nil).
flat(tree(X, niltree, XS), cons(X, YS)) :- ','(right(tree(X, niltree, XS), ZS), flat(ZS, YS)).
flat(tree(X, tree(Y, YS1, YS2), XS), ZS) :- flat(tree(Y, YS1, tree(X, YS2, XS)), ZS).

popout

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

job log

popout

actions all output return to Logic Programming