Logic Programming pair #487096642

details

property	value
status	complete
benchmark	example4-2.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_talp

run statistics

property	value
solver	AProVE
configuration	standard
runtime (wallclock)	2.45867 seconds
cpu usage	6.55725
user time	6.16885
system time	0.388404
max virtual memory	1.9511584E7
max residence set size	786540.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

p2(a)

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


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

(0)
Obligation:
Clauses:

p1(f(X)) :- p1(X).
p2(f(X)) :- p2(X).


Query: p2(a)
----------------------------------------

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

p2_in_1: (f)

Transforming Prolog into the following Term Rewriting System:

Pi-finite rewrite system:
The TRS R consists of the following rules:

   p2_in_a(f(X)) -> U2_a(X, p2_in_a(X))
   U2_a(X, p2_out_a(X)) -> p2_out_a(f(X))

The argument filtering Pi contains the following mapping:
p2_in_a(x1)  =  p2_in_a

U2_a(x1, x2)  =  U2_a(x2)

p2_out_a(x1)  =  p2_out_a(x1)

popout

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

job log

popout

actions all output return to Logic Programming