Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716751
details
property
value
status
complete
benchmark
ExIntrod_Zan97_Z.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n099.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.017881155014 seconds
cpu usage
0.014566185
max memory
1601536.0
stage attributes
key
value
output-size
2336
starexec-result
NO
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Problem 1: (VAR X X1 X2 Y) (RULES activate(n__prod(X1,X2)) -> prod(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X add(s(X),Y) -> s(add(X,Y)) add(0,X) -> X fact(X) -> if(zero(X),n__s(0),n__prod(X,fact(p(X)))) if(false,X,Y) -> activate(Y) if(true,X,Y) -> activate(X) p(s(X)) -> X prod(s(X),Y) -> add(Y,prod(X,Y)) prod(0,X) -> 0 prod(X1,X2) -> n__prod(X1,X2) s(X) -> n__s(X) zero(s(X)) -> false zero(0) -> true ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__prod(X1,X2)) -> PROD(X1,X2) ACTIVATE(n__s(X)) -> S(X) ADD(s(X),Y) -> ADD(X,Y) ADD(s(X),Y) -> S(add(X,Y)) FACT(X) -> FACT(p(X)) FACT(X) -> IF(zero(X),n__s(0),n__prod(X,fact(p(X)))) FACT(X) -> P(X) FACT(X) -> ZERO(X) IF(false,X,Y) -> ACTIVATE(Y) IF(true,X,Y) -> ACTIVATE(X) PROD(s(X),Y) -> ADD(Y,prod(X,Y)) PROD(s(X),Y) -> PROD(X,Y) -> Rules: activate(n__prod(X1,X2)) -> prod(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X add(s(X),Y) -> s(add(X,Y)) add(0,X) -> X fact(X) -> if(zero(X),n__s(0),n__prod(X,fact(p(X)))) if(false,X,Y) -> activate(Y) if(true,X,Y) -> activate(X) p(s(X)) -> X prod(s(X),Y) -> add(Y,prod(X,Y)) prod(0,X) -> 0 prod(X1,X2) -> n__prod(X1,X2) s(X) -> n__s(X) zero(s(X)) -> false zero(0) -> true Problem 1: Infinite Processor: -> Pairs: ACTIVATE(n__prod(X1,X2)) -> PROD(X1,X2) ACTIVATE(n__s(X)) -> S(X) ADD(s(X),Y) -> ADD(X,Y) ADD(s(X),Y) -> S(add(X,Y)) FACT(X) -> FACT(p(X)) FACT(X) -> IF(zero(X),n__s(0),n__prod(X,fact(p(X)))) FACT(X) -> P(X) FACT(X) -> ZERO(X) IF(false,X,Y) -> ACTIVATE(Y) IF(true,X,Y) -> ACTIVATE(X) PROD(s(X),Y) -> ADD(Y,prod(X,Y)) PROD(s(X),Y) -> PROD(X,Y) -> Rules: activate(n__prod(X1,X2)) -> prod(X1,X2) activate(n__s(X)) -> s(X) activate(X) -> X add(s(X),Y) -> s(add(X,Y)) add(0,X) -> X fact(X) -> if(zero(X),n__s(0),n__prod(X,fact(p(X)))) if(false,X,Y) -> activate(Y) if(true,X,Y) -> activate(X) p(s(X)) -> X prod(s(X),Y) -> add(Y,prod(X,Y)) prod(0,X) -> 0 prod(X1,X2) -> n__prod(X1,X2) s(X) -> n__s(X) zero(s(X)) -> false zero(0) -> true -> Pairs in cycle: FACT(X) -> FACT(p(X)) The problem is infinite.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472