Logic Programming pair #487096190

details

property	value
status	complete
benchmark	pl4.5.3b.pl
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n147.star.cs.uiowa.edu
space	talp_plumer

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	3.21426 seconds
cpu usage	9.34956
user time	8.75965
system time	0.589908
max virtual memory	2.0745308E7
max residence set size	1145148.0

stage attributes

key	value
starexec-result	MAYBE

output

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


Left Termination of the query pattern

p(g)

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

(0) Prolog
(1) PrologToPiTRSProof [SOUND, 0 ms]
(2) PiTRS
    (3) DependencyPairsProof [EQUIVALENT, 0 ms]
    (4) PiDP
    (5) DependencyGraphProof [EQUIVALENT, 0 ms]
    (6) PiDP
    (7) UsableRulesProof [EQUIVALENT, 0 ms]
    (8) PiDP
    (9) PiDPToQDPProof [EQUIVALENT, 0 ms]
    (10) QDP
    (11) TransformationProof [EQUIVALENT, 0 ms]
    (12) QDP
    (13) NonTerminationLoopProof [COMPLETE, 0 ms]
    (14) NO
(15) PrologToPiTRSProof [SOUND, 0 ms]
(16) PiTRS
    (17) DependencyPairsProof [EQUIVALENT, 0 ms]
    (18) PiDP
    (19) DependencyGraphProof [EQUIVALENT, 0 ms]
    (20) PiDP
    (21) UsableRulesProof [EQUIVALENT, 0 ms]
    (22) PiDP
    (23) PiDPToQDPProof [EQUIVALENT, 0 ms]
    (24) QDP
    (25) TransformationProof [EQUIVALENT, 0 ms]
    (26) QDP
    (27) NonTerminationLoopProof [COMPLETE, 0 ms]
    (28) NO
(29) PrologToDTProblemTransformerProof [SOUND, 0 ms]
(30) TRIPLES
    (31) TriplesToPiDPProof [SOUND, 0 ms]
    (32) PiDP
    (33) DependencyGraphProof [EQUIVALENT, 0 ms]
    (34) PiDP
    (35) PiDPToQDPProof [EQUIVALENT, 0 ms]
    (36) QDP
    (37) TransformationProof [EQUIVALENT, 0 ms]
    (38) QDP
    (39) NonTerminationLoopProof [COMPLETE, 0 ms]
    (40) NO
(41) PrologToTRSTransformerProof [SOUND, 0 ms]
(42) QTRS
    (43) QTRSRRRProof [EQUIVALENT, 43 ms]
    (44) QTRS
    (45) QTRSRRRProof [EQUIVALENT, 4 ms]
    (46) QTRS
    (47) Overlay + Local Confluence [EQUIVALENT, 0 ms]
    (48) QTRS
    (49) DependencyPairsProof [EQUIVALENT, 0 ms]
    (50) QDP
    (51) UsableRulesProof [EQUIVALENT, 0 ms]
    (52) QDP
    (53) QReductionProof [EQUIVALENT, 0 ms]
    (54) QDP
    (55) TransformationProof [EQUIVALENT, 0 ms]
    (56) QDP
    (57) NonTerminationLoopProof [COMPLETE, 0 ms]
    (58) NO
(59) PrologToIRSwTTransformerProof [SOUND, 0 ms]
(60) IRSwT
    (61) IRSwTSimpleDependencyGraphProof [EQUIVALENT, 0 ms]
    (62) IRSwT
    (63) IntTRSCompressionProof [EQUIVALENT, 55 ms]
    (64) IRSwT
    (65) IRSFormatTransformerProof [EQUIVALENT, 0 ms]
    (66) IRSwT
    (67) IRSwTTerminationDigraphProof [EQUIVALENT, 0 ms]
    (68) IRSwT
    (69) IRSwTToIntTRSProof [SOUND, 10 ms]
    (70) IRSwT


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

(0)
Obligation:
Clauses:

p(a).
p(X) :- p(a).
q(b).


Query: p(g)
----------------------------------------

(1) PrologToPiTRSProof (SOUND)
We use the technique of [TOCL09]. With regard to the inferred argument filtering the predicates were used in the following modes:

popout

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

job log

popout

actions all output return to Logic Programming