Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716501
details
property
value
status
complete
benchmark
PALINDROME_nosorts_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n027.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.0890111923218 seconds
cpu usage
0.088881701
max memory
5156864.0
stage attributes
key
value
output-size
30786
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 I P X X1 X2 Y Z) (RULES __(mark(X1),X2) -> mark(__(X1,X2)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(nil,X)) -> mark(X) active(__(X,nil)) -> mark(X) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(tt,X)) -> mark(X) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(__(I,__(P,I)))) -> mark(tt) active(isNePal(X)) -> isNePal(active(X)) and(mark(X1),X2) -> mark(and(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) isNePal(ok(X)) -> ok(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(isNePal(X)) -> isNePal(proper(X)) proper(nil) -> ok(nil) proper(tt) -> ok(tt) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) ) Problem 1: Dependency Pairs Processor: -> Pairs: __#(mark(X1),X2) -> __#(X1,X2) __#(ok(X1),ok(X2)) -> __#(X1,X2) __#(X1,mark(X2)) -> __#(X1,X2) ACTIVE(__(__(X,Y),Z)) -> __#(X,__(Y,Z)) ACTIVE(__(__(X,Y),Z)) -> __#(Y,Z) ACTIVE(__(X1,X2)) -> __#(active(X1),X2) ACTIVE(__(X1,X2)) -> __#(X1,active(X2)) ACTIVE(__(X1,X2)) -> ACTIVE(X1) ACTIVE(__(X1,X2)) -> ACTIVE(X2) ACTIVE(and(X1,X2)) -> ACTIVE(X1) ACTIVE(and(X1,X2)) -> AND(active(X1),X2) ACTIVE(isNePal(X)) -> ACTIVE(X) ACTIVE(isNePal(X)) -> ISNEPAL(active(X)) AND(mark(X1),X2) -> AND(X1,X2) AND(ok(X1),ok(X2)) -> AND(X1,X2) ISNEPAL(mark(X)) -> ISNEPAL(X) ISNEPAL(ok(X)) -> ISNEPAL(X) PROPER(__(X1,X2)) -> __#(proper(X1),proper(X2)) PROPER(__(X1,X2)) -> PROPER(X1) PROPER(__(X1,X2)) -> PROPER(X2) PROPER(and(X1,X2)) -> AND(proper(X1),proper(X2)) PROPER(and(X1,X2)) -> PROPER(X1) PROPER(and(X1,X2)) -> PROPER(X2) PROPER(isNePal(X)) -> ISNEPAL(proper(X)) PROPER(isNePal(X)) -> PROPER(X) TOP(mark(X)) -> PROPER(X) TOP(mark(X)) -> TOP(proper(X)) TOP(ok(X)) -> ACTIVE(X) TOP(ok(X)) -> TOP(active(X)) -> Rules: __(mark(X1),X2) -> mark(__(X1,X2)) __(ok(X1),ok(X2)) -> ok(__(X1,X2)) __(X1,mark(X2)) -> mark(__(X1,X2)) active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z))) active(__(nil,X)) -> mark(X) active(__(X,nil)) -> mark(X) active(__(X1,X2)) -> __(active(X1),X2) active(__(X1,X2)) -> __(X1,active(X2)) active(and(tt,X)) -> mark(X) active(and(X1,X2)) -> and(active(X1),X2) active(isNePal(__(I,__(P,I)))) -> mark(tt) active(isNePal(X)) -> isNePal(active(X)) and(mark(X1),X2) -> mark(and(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) isNePal(mark(X)) -> mark(isNePal(X)) isNePal(ok(X)) -> ok(isNePal(X)) proper(__(X1,X2)) -> __(proper(X1),proper(X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(isNePal(X)) -> isNePal(proper(X)) proper(nil) -> ok(nil) proper(tt) -> ok(tt) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Problem 1: SCC Processor: -> Pairs: __#(mark(X1),X2) -> __#(X1,X2)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472