(0) Obligation:
Clauses:
tree_member(X, tree(X, X1, X2)).
tree_member(X, tree(X3, Left, X4)) :- tree_member(X, Left).
tree_member(X, tree(X5, X6, Right)) :- tree_member(X, Right).
Queries:
tree_member(g,a).
(1) PrologToDTProblemTransformerProof (SOUND transformation)
Built DT problem from termination graph.
(2) Obligation:
Triples:
tree_member1(T49, tree(T14, tree(T50, T53, T52), T16)) :- tree_member1(T49, T53).
tree_member1(T76, tree(T14, tree(T77, T78, T80), T16)) :- tree_member1(T76, T80).
tree_member1(T95, tree(T96, T97, T99)) :- tree_member1(T95, T99).
tree_member1(T146, tree(T111, T112, tree(T147, T150, T149))) :- tree_member1(T146, T150).
tree_member1(T165, tree(T111, T112, tree(T166, T167, T169))) :- tree_member1(T165, T169).
tree_member1(T216, tree(T181, tree(T217, T220, T219), T183)) :- tree_member1(T216, T220).
tree_member1(T243, tree(T181, tree(T244, T245, T247), T183)) :- tree_member1(T243, T247).
tree_member1(T262, tree(T263, T264, T266)) :- tree_member1(T262, T266).
tree_member1(T313, tree(T278, T279, tree(T314, T317, T316))) :- tree_member1(T313, T317).
tree_member1(T332, tree(T278, T279, tree(T333, T334, T336))) :- tree_member1(T332, T336).
Clauses:
tree_memberc1(T6, tree(T6, T7, T8)).
tree_memberc1(T30, tree(T14, tree(T30, T31, T32), T16)).
tree_memberc1(T49, tree(T14, tree(T50, T53, T52), T16)) :- tree_memberc1(T49, T53).
tree_memberc1(T76, tree(T14, tree(T77, T78, T80), T16)) :- tree_memberc1(T76, T80).
tree_memberc1(T95, tree(T96, T97, T99)) :- tree_memberc1(T95, T99).
tree_memberc1(T127, tree(T111, T112, tree(T127, T128, T129))).
tree_memberc1(T146, tree(T111, T112, tree(T147, T150, T149))) :- tree_memberc1(T146, T150).
tree_memberc1(T165, tree(T111, T112, tree(T166, T167, T169))) :- tree_memberc1(T165, T169).
tree_memberc1(T197, tree(T181, tree(T197, T198, T199), T183)).
tree_memberc1(T216, tree(T181, tree(T217, T220, T219), T183)) :- tree_memberc1(T216, T220).
tree_memberc1(T243, tree(T181, tree(T244, T245, T247), T183)) :- tree_memberc1(T243, T247).
tree_memberc1(T262, tree(T263, T264, T266)) :- tree_memberc1(T262, T266).
tree_memberc1(T294, tree(T278, T279, tree(T294, T295, T296))).
tree_memberc1(T313, tree(T278, T279, tree(T314, T317, T316))) :- tree_memberc1(T313, T317).
tree_memberc1(T332, tree(T278, T279, tree(T333, T334, T336))) :- tree_memberc1(T332, T336).
Afs:
tree_member1(x1, x2) = tree_member1(x1)
(3) TriplesToPiDPProof (SOUND transformation)
We use the technique of [LOPSTR]. With regard to the inferred argument filtering the predicates were used in the following modes:
tree_member1_in: (b,f)
Transforming
TRIPLES into the following
Term Rewriting System:
Pi DP problem:
The TRS P consists of the following rules:
TREE_MEMBER1_IN_GA(T49, tree(T14, tree(T50, T53, T52), T16)) → U1_GA(T49, T14, T50, T53, T52, T16, tree_member1_in_ga(T49, T53))
TREE_MEMBER1_IN_GA(T49, tree(T14, tree(T50, T53, T52), T16)) → TREE_MEMBER1_IN_GA(T49, T53)
TREE_MEMBER1_IN_GA(T76, tree(T14, tree(T77, T78, T80), T16)) → U2_GA(T76, T14, T77, T78, T80, T16, tree_member1_in_ga(T76, T80))
TREE_MEMBER1_IN_GA(T76, tree(T14, tree(T77, T78, T80), T16)) → TREE_MEMBER1_IN_GA(T76, T80)
TREE_MEMBER1_IN_GA(T95, tree(T96, T97, T99)) → U3_GA(T95, T96, T97, T99, tree_member1_in_ga(T95, T99))
TREE_MEMBER1_IN_GA(T95, tree(T96, T97, T99)) → TREE_MEMBER1_IN_GA(T95, T99)
TREE_MEMBER1_IN_GA(T146, tree(T111, T112, tree(T147, T150, T149))) → U4_GA(T146, T111, T112, T147, T150, T149, tree_member1_in_ga(T146, T150))
TREE_MEMBER1_IN_GA(T146, tree(T111, T112, tree(T147, T150, T149))) → TREE_MEMBER1_IN_GA(T146, T150)
TREE_MEMBER1_IN_GA(T165, tree(T111, T112, tree(T166, T167, T169))) → U5_GA(T165, T111, T112, T166, T167, T169, tree_member1_in_ga(T165, T169))
TREE_MEMBER1_IN_GA(T165, tree(T111, T112, tree(T166, T167, T169))) → TREE_MEMBER1_IN_GA(T165, T169)
TREE_MEMBER1_IN_GA(T216, tree(T181, tree(T217, T220, T219), T183)) → U6_GA(T216, T181, T217, T220, T219, T183, tree_member1_in_ga(T216, T220))
TREE_MEMBER1_IN_GA(T243, tree(T181, tree(T244, T245, T247), T183)) → U7_GA(T243, T181, T244, T245, T247, T183, tree_member1_in_ga(T243, T247))
TREE_MEMBER1_IN_GA(T262, tree(T263, T264, T266)) → U8_GA(T262, T263, T264, T266, tree_member1_in_ga(T262, T266))
TREE_MEMBER1_IN_GA(T313, tree(T278, T279, tree(T314, T317, T316))) → U9_GA(T313, T278, T279, T314, T317, T316, tree_member1_in_ga(T313, T317))
TREE_MEMBER1_IN_GA(T332, tree(T278, T279, tree(T333, T334, T336))) → U10_GA(T332, T278, T279, T333, T334, T336, tree_member1_in_ga(T332, T336))
R is empty.
The argument filtering Pi contains the following mapping:
tree_member1_in_ga(
x1,
x2) =
tree_member1_in_ga(
x1)
TREE_MEMBER1_IN_GA(
x1,
x2) =
TREE_MEMBER1_IN_GA(
x1)
U1_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7) =
U1_GA(
x1,
x7)
U2_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7) =
U2_GA(
x1,
x7)
U3_GA(
x1,
x2,
x3,
x4,
x5) =
U3_GA(
x1,
x5)
U4_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7) =
U4_GA(
x1,
x7)
U5_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7) =
U5_GA(
x1,
x7)
U6_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7) =
U6_GA(
x1,
x7)
U7_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7) =
U7_GA(
x1,
x7)
U8_GA(
x1,
x2,
x3,
x4,
x5) =
U8_GA(
x1,
x5)
U9_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7) =
U9_GA(
x1,
x7)
U10_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7) =
U10_GA(
x1,
x7)
We have to consider all (P,R,Pi)-chains
Infinitary Constructor Rewriting Termination of PiDP implies Termination of TRIPLES
(4) Obligation:
Pi DP problem:
The TRS P consists of the following rules:
TREE_MEMBER1_IN_GA(T49, tree(T14, tree(T50, T53, T52), T16)) → U1_GA(T49, T14, T50, T53, T52, T16, tree_member1_in_ga(T49, T53))
TREE_MEMBER1_IN_GA(T49, tree(T14, tree(T50, T53, T52), T16)) → TREE_MEMBER1_IN_GA(T49, T53)
TREE_MEMBER1_IN_GA(T76, tree(T14, tree(T77, T78, T80), T16)) → U2_GA(T76, T14, T77, T78, T80, T16, tree_member1_in_ga(T76, T80))
TREE_MEMBER1_IN_GA(T76, tree(T14, tree(T77, T78, T80), T16)) → TREE_MEMBER1_IN_GA(T76, T80)
TREE_MEMBER1_IN_GA(T95, tree(T96, T97, T99)) → U3_GA(T95, T96, T97, T99, tree_member1_in_ga(T95, T99))
TREE_MEMBER1_IN_GA(T95, tree(T96, T97, T99)) → TREE_MEMBER1_IN_GA(T95, T99)
TREE_MEMBER1_IN_GA(T146, tree(T111, T112, tree(T147, T150, T149))) → U4_GA(T146, T111, T112, T147, T150, T149, tree_member1_in_ga(T146, T150))
TREE_MEMBER1_IN_GA(T146, tree(T111, T112, tree(T147, T150, T149))) → TREE_MEMBER1_IN_GA(T146, T150)
TREE_MEMBER1_IN_GA(T165, tree(T111, T112, tree(T166, T167, T169))) → U5_GA(T165, T111, T112, T166, T167, T169, tree_member1_in_ga(T165, T169))
TREE_MEMBER1_IN_GA(T165, tree(T111, T112, tree(T166, T167, T169))) → TREE_MEMBER1_IN_GA(T165, T169)
TREE_MEMBER1_IN_GA(T216, tree(T181, tree(T217, T220, T219), T183)) → U6_GA(T216, T181, T217, T220, T219, T183, tree_member1_in_ga(T216, T220))
TREE_MEMBER1_IN_GA(T243, tree(T181, tree(T244, T245, T247), T183)) → U7_GA(T243, T181, T244, T245, T247, T183, tree_member1_in_ga(T243, T247))
TREE_MEMBER1_IN_GA(T262, tree(T263, T264, T266)) → U8_GA(T262, T263, T264, T266, tree_member1_in_ga(T262, T266))
TREE_MEMBER1_IN_GA(T313, tree(T278, T279, tree(T314, T317, T316))) → U9_GA(T313, T278, T279, T314, T317, T316, tree_member1_in_ga(T313, T317))
TREE_MEMBER1_IN_GA(T332, tree(T278, T279, tree(T333, T334, T336))) → U10_GA(T332, T278, T279, T333, T334, T336, tree_member1_in_ga(T332, T336))
R is empty.
The argument filtering Pi contains the following mapping:
tree_member1_in_ga(
x1,
x2) =
tree_member1_in_ga(
x1)
TREE_MEMBER1_IN_GA(
x1,
x2) =
TREE_MEMBER1_IN_GA(
x1)
U1_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7) =
U1_GA(
x1,
x7)
U2_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7) =
U2_GA(
x1,
x7)
U3_GA(
x1,
x2,
x3,
x4,
x5) =
U3_GA(
x1,
x5)
U4_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7) =
U4_GA(
x1,
x7)
U5_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7) =
U5_GA(
x1,
x7)
U6_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7) =
U6_GA(
x1,
x7)
U7_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7) =
U7_GA(
x1,
x7)
U8_GA(
x1,
x2,
x3,
x4,
x5) =
U8_GA(
x1,
x5)
U9_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7) =
U9_GA(
x1,
x7)
U10_GA(
x1,
x2,
x3,
x4,
x5,
x6,
x7) =
U10_GA(
x1,
x7)
We have to consider all (P,R,Pi)-chains
(5) DependencyGraphProof (EQUIVALENT transformation)
The approximation of the Dependency Graph [LOPSTR] contains 1 SCC with 10 less nodes.
(6) Obligation:
Pi DP problem:
The TRS P consists of the following rules:
TREE_MEMBER1_IN_GA(T76, tree(T14, tree(T77, T78, T80), T16)) → TREE_MEMBER1_IN_GA(T76, T80)
TREE_MEMBER1_IN_GA(T49, tree(T14, tree(T50, T53, T52), T16)) → TREE_MEMBER1_IN_GA(T49, T53)
TREE_MEMBER1_IN_GA(T95, tree(T96, T97, T99)) → TREE_MEMBER1_IN_GA(T95, T99)
TREE_MEMBER1_IN_GA(T146, tree(T111, T112, tree(T147, T150, T149))) → TREE_MEMBER1_IN_GA(T146, T150)
TREE_MEMBER1_IN_GA(T165, tree(T111, T112, tree(T166, T167, T169))) → TREE_MEMBER1_IN_GA(T165, T169)
R is empty.
The argument filtering Pi contains the following mapping:
TREE_MEMBER1_IN_GA(
x1,
x2) =
TREE_MEMBER1_IN_GA(
x1)
We have to consider all (P,R,Pi)-chains
(7) PiDPToQDPProof (SOUND transformation)
Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.
(8) Obligation:
Q DP problem:
The TRS P consists of the following rules:
TREE_MEMBER1_IN_GA(T76) → TREE_MEMBER1_IN_GA(T76)
R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
(9) NonTerminationProof (EQUIVALENT transformation)
We used the non-termination processor [FROCOS05] to show that the DP problem is infinite.
Found a loop by semiunifying a rule from P directly.
s =
TREE_MEMBER1_IN_GA(
T76) evaluates to t =
TREE_MEMBER1_IN_GA(
T76)
Thus s starts an infinite chain as s semiunifies with t with the following substitutions:
- Semiunifier: [ ]
- Matcher: [ ]
Rewriting sequenceThe DP semiunifies directly so there is only one rewrite step from TREE_MEMBER1_IN_GA(T76) to TREE_MEMBER1_IN_GA(T76).
(10) NO