Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715606
details
property
value
status
complete
benchmark
Ex1_2_AEL03_FR.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n038.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0225169658661 seconds
cpu usage
0.02017845
max memory
2469888.0
stage attributes
key
value
output-size
13348
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR N X X1 X2 Y Z) (RULES 2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> rcons(negrecip(activate(Y)),2ndspos(N,activate(Z))) 2ndsneg(0,Z) -> rnil 2ndspos(s(N),cons(X,n__cons(Y,Z))) -> rcons(posrecip(activate(Y)),2ndsneg(N,activate(Z))) 2ndspos(0,Z) -> rnil activate(n__cons(X1,X2)) -> cons(activate(X1),X2) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X cons(X1,X2) -> n__cons(X1,X2) from(X) -> cons(X,n__from(n__s(X))) from(X) -> n__from(X) pi(X) -> 2ndspos(X,from(0)) plus(s(X),Y) -> s(plus(X,Y)) plus(0,Y) -> Y s(X) -> n__s(X) square(X) -> times(X,X) times(s(X),Y) -> plus(Y,times(X,Y)) times(0,Y) -> 0 ) Problem 1: Dependency Pairs Processor: -> Pairs: 2NDSNEG(s(N),cons(X,n__cons(Y,Z))) -> 2NDSPOS(N,activate(Z)) 2NDSNEG(s(N),cons(X,n__cons(Y,Z))) -> ACTIVATE(Y) 2NDSNEG(s(N),cons(X,n__cons(Y,Z))) -> ACTIVATE(Z) 2NDSPOS(s(N),cons(X,n__cons(Y,Z))) -> 2NDSNEG(N,activate(Z)) 2NDSPOS(s(N),cons(X,n__cons(Y,Z))) -> ACTIVATE(Y) 2NDSPOS(s(N),cons(X,n__cons(Y,Z))) -> ACTIVATE(Z) ACTIVATE(n__cons(X1,X2)) -> ACTIVATE(X1) ACTIVATE(n__cons(X1,X2)) -> CONS(activate(X1),X2) ACTIVATE(n__from(X)) -> ACTIVATE(X) ACTIVATE(n__from(X)) -> FROM(activate(X)) ACTIVATE(n__s(X)) -> ACTIVATE(X) ACTIVATE(n__s(X)) -> S(activate(X)) FROM(X) -> CONS(X,n__from(n__s(X))) PI(X) -> 2NDSPOS(X,from(0)) PI(X) -> FROM(0) PLUS(s(X),Y) -> PLUS(X,Y) PLUS(s(X),Y) -> S(plus(X,Y)) SQUARE(X) -> TIMES(X,X) TIMES(s(X),Y) -> PLUS(Y,times(X,Y)) TIMES(s(X),Y) -> TIMES(X,Y) -> Rules: 2ndsneg(s(N),cons(X,n__cons(Y,Z))) -> rcons(negrecip(activate(Y)),2ndspos(N,activate(Z))) 2ndsneg(0,Z) -> rnil 2ndspos(s(N),cons(X,n__cons(Y,Z))) -> rcons(posrecip(activate(Y)),2ndsneg(N,activate(Z))) 2ndspos(0,Z) -> rnil activate(n__cons(X1,X2)) -> cons(activate(X1),X2) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(activate(X)) activate(X) -> X cons(X1,X2) -> n__cons(X1,X2) from(X) -> cons(X,n__from(n__s(X))) from(X) -> n__from(X) pi(X) -> 2ndspos(X,from(0)) plus(s(X),Y) -> s(plus(X,Y)) plus(0,Y) -> Y s(X) -> n__s(X) square(X) -> times(X,X) times(s(X),Y) -> plus(Y,times(X,Y)) times(0,Y) -> 0 Problem 1: SCC Processor: -> Pairs: 2NDSNEG(s(N),cons(X,n__cons(Y,Z))) -> 2NDSPOS(N,activate(Z)) 2NDSNEG(s(N),cons(X,n__cons(Y,Z))) -> ACTIVATE(Y) 2NDSNEG(s(N),cons(X,n__cons(Y,Z))) -> ACTIVATE(Z) 2NDSPOS(s(N),cons(X,n__cons(Y,Z))) -> 2NDSNEG(N,activate(Z)) 2NDSPOS(s(N),cons(X,n__cons(Y,Z))) -> ACTIVATE(Y) 2NDSPOS(s(N),cons(X,n__cons(Y,Z))) -> ACTIVATE(Z) ACTIVATE(n__cons(X1,X2)) -> ACTIVATE(X1) ACTIVATE(n__cons(X1,X2)) -> CONS(activate(X1),X2) ACTIVATE(n__from(X)) -> ACTIVATE(X) ACTIVATE(n__from(X)) -> FROM(activate(X)) ACTIVATE(n__s(X)) -> ACTIVATE(X) ACTIVATE(n__s(X)) -> S(activate(X)) FROM(X) -> CONS(X,n__from(n__s(X))) PI(X) -> 2NDSPOS(X,from(0)) PI(X) -> FROM(0) PLUS(s(X),Y) -> PLUS(X,Y) PLUS(s(X),Y) -> S(plus(X,Y)) SQUARE(X) -> TIMES(X,X) TIMES(s(X),Y) -> PLUS(Y,times(X,Y)) TIMES(s(X),Y) -> TIMES(X,Y)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472