/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


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


NO

Problem 1: 

(VAR x y z)
(RULES
*(*(x,y),z) -> *(x,*(y,z))
*(+(x,y),z) -> +(*(x,z),*(y,z))
*(x,+(y,f(z))) -> *(g(x,z),+(y,y))
)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 *#(*(x,y),z) -> *#(x,*(y,z))
 *#(*(x,y),z) -> *#(y,z)
 *#(+(x,y),z) -> *#(x,z)
 *#(+(x,y),z) -> *#(y,z)
 *#(x,+(y,f(z))) -> *#(g(x,z),+(y,y))
-> Rules:
 *(*(x,y),z) -> *(x,*(y,z))
 *(+(x,y),z) -> +(*(x,z),*(y,z))
 *(x,+(y,f(z))) -> *(g(x,z),+(y,y))

Problem 1: 

SCC Processor:
-> Pairs:
 *#(*(x,y),z) -> *#(x,*(y,z))
 *#(*(x,y),z) -> *#(y,z)
 *#(+(x,y),z) -> *#(x,z)
 *#(+(x,y),z) -> *#(y,z)
 *#(x,+(y,f(z))) -> *#(g(x,z),+(y,y))
-> Rules:
 *(*(x,y),z) -> *(x,*(y,z))
 *(+(x,y),z) -> +(*(x,z),*(y,z))
 *(x,+(y,f(z))) -> *(g(x,z),+(y,y))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 *#(x,+(y,f(z))) -> *#(g(x,z),+(y,y))
->->-> Rules:
 *(*(x,y),z) -> *(x,*(y,z))
 *(+(x,y),z) -> +(*(x,z),*(y,z))
 *(x,+(y,f(z))) -> *(g(x,z),+(y,y))
->->Cycle:
->->-> Pairs:
 *#(*(x,y),z) -> *#(x,*(y,z))
 *#(*(x,y),z) -> *#(y,z)
 *#(+(x,y),z) -> *#(x,z)
 *#(+(x,y),z) -> *#(y,z)
->->-> Rules:
 *(*(x,y),z) -> *(x,*(y,z))
 *(+(x,y),z) -> +(*(x,z),*(y,z))
 *(x,+(y,f(z))) -> *(g(x,z),+(y,y))

Problem 1: 

Instantiation Processor:
-> Pairs:
 *#(x,+(y,f(z))) -> *#(g(x,z),+(y,y))
-> Rules:
 *(*(x,y),z) -> *(x,*(y,z))
 *(+(x,y),z) -> +(*(x,z),*(y,z))
 *(x,+(y,f(z))) -> *(g(x,z),+(y,y))
->Instantiated Pairs:
->->Original Pair:
 *#(x,+(y,f(z))) -> *#(g(x,z),+(y,y))
->-> Instantiated pairs:
 *#(g(x3,x4),+(y,f(z))) -> *#(g(g(x3,x4),z),+(y,y))

Problem 1: 

SCC Processor:
-> Pairs:
 *#(g(x3,x4),+(y,f(z))) -> *#(g(g(x3,x4),z),+(y,y))
-> Rules:
 *(*(x,y),z) -> *(x,*(y,z))
 *(+(x,y),z) -> +(*(x,z),*(y,z))
 *(x,+(y,f(z))) -> *(g(x,z),+(y,y))
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 *#(g(x3,x4),+(y,f(z))) -> *#(g(g(x3,x4),z),+(y,y))
->->-> Rules:
 *(*(x,y),z) -> *(x,*(y,z))
 *(+(x,y),z) -> +(*(x,z),*(y,z))
 *(x,+(y,f(z))) -> *(g(x,z),+(y,y))

Problem 1: 

Forward Instantiation Processor:
-> Pairs:
 *#(g(x3,x4),+(y,f(z))) -> *#(g(g(x3,x4),z),+(y,y))
-> Rules:
 *(*(x,y),z) -> *(x,*(y,z))
 *(+(x,y),z) -> +(*(x,z),*(y,z))
 *(x,+(y,f(z))) -> *(g(x,z),+(y,y))
->Instantiated Pairs:
->->Original Pair:
 *#(g(x3,x4),+(y,f(z))) -> *#(g(g(x3,x4),z),+(y,y))
->-> Instantiated pairs:
 *#(g(x3,x4),+(f(x8),f(z))) -> *#(g(g(x3,x4),z),+(f(x8),f(x8)))

Problem 1: 

Infinite Processor:
-> Pairs:
 *#(g(x3,x4),+(f(x8),f(z))) -> *#(g(g(x3,x4),z),+(f(x8),f(x8)))
-> Rules:
 *(*(x,y),z) -> *(x,*(y,z))
 *(+(x,y),z) -> +(*(x,z),*(y,z))
 *(x,+(y,f(z))) -> *(g(x,z),+(y,y))
-> Pairs in cycle:
 *#(g(x3,x4),+(f(x8),f(z))) -> *#(g(g(x3,x4),z),+(f(x8),f(x8)))

The problem is infinite.