Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381715056
details
property
value
status
complete
benchmark
Ex5_Zan97_C.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
3.31022715569 seconds
cpu usage
3.283332973
max memory
2.0914176E7
stage attributes
key
value
output-size
21603
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR X X1 X2 X3 Y) (RULES active(f(X)) -> f(active(X)) active(f(X)) -> mark(if(X,c,f(true))) active(if(false,X,Y)) -> mark(Y) active(if(true,X,Y)) -> mark(X) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(if(X1,X2,X3)) -> if(X1,active(X2),X3) f(mark(X)) -> mark(f(X)) f(ok(X)) -> ok(f(X)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) if(X1,mark(X2),X3) -> mark(if(X1,X2,X3)) proper(f(X)) -> f(proper(X)) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(c) -> ok(c) proper(false) -> ok(false) proper(true) -> ok(true) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(f(X)) -> ACTIVE(X) ACTIVE(f(X)) -> F(active(X)) ACTIVE(f(X)) -> IF(X,c,f(true)) ACTIVE(if(X1,X2,X3)) -> ACTIVE(X1) ACTIVE(if(X1,X2,X3)) -> ACTIVE(X2) ACTIVE(if(X1,X2,X3)) -> IF(active(X1),X2,X3) ACTIVE(if(X1,X2,X3)) -> IF(X1,active(X2),X3) F(mark(X)) -> F(X) F(ok(X)) -> F(X) IF(mark(X1),X2,X3) -> IF(X1,X2,X3) IF(ok(X1),ok(X2),ok(X3)) -> IF(X1,X2,X3) IF(X1,mark(X2),X3) -> IF(X1,X2,X3) PROPER(f(X)) -> F(proper(X)) PROPER(f(X)) -> PROPER(X) PROPER(if(X1,X2,X3)) -> IF(proper(X1),proper(X2),proper(X3)) PROPER(if(X1,X2,X3)) -> PROPER(X1) PROPER(if(X1,X2,X3)) -> PROPER(X2) PROPER(if(X1,X2,X3)) -> PROPER(X3) TOP(mark(X)) -> PROPER(X) TOP(mark(X)) -> TOP(proper(X)) TOP(ok(X)) -> ACTIVE(X) TOP(ok(X)) -> TOP(active(X)) -> Rules: active(f(X)) -> f(active(X)) active(f(X)) -> mark(if(X,c,f(true))) active(if(false,X,Y)) -> mark(Y) active(if(true,X,Y)) -> mark(X) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) active(if(X1,X2,X3)) -> if(X1,active(X2),X3) f(mark(X)) -> mark(f(X)) f(ok(X)) -> ok(f(X)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) if(X1,mark(X2),X3) -> mark(if(X1,X2,X3)) proper(f(X)) -> f(proper(X)) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(c) -> ok(c) proper(false) -> ok(false) proper(true) -> ok(true) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) Problem 1: SCC Processor: -> Pairs: ACTIVE(f(X)) -> ACTIVE(X) ACTIVE(f(X)) -> F(active(X)) ACTIVE(f(X)) -> IF(X,c,f(true)) ACTIVE(if(X1,X2,X3)) -> ACTIVE(X1) ACTIVE(if(X1,X2,X3)) -> ACTIVE(X2) ACTIVE(if(X1,X2,X3)) -> IF(active(X1),X2,X3) ACTIVE(if(X1,X2,X3)) -> IF(X1,active(X2),X3) F(mark(X)) -> F(X) F(ok(X)) -> F(X) IF(mark(X1),X2,X3) -> IF(X1,X2,X3) IF(ok(X1),ok(X2),ok(X3)) -> IF(X1,X2,X3) IF(X1,mark(X2),X3) -> IF(X1,X2,X3) PROPER(f(X)) -> F(proper(X)) PROPER(f(X)) -> PROPER(X) PROPER(if(X1,X2,X3)) -> IF(proper(X1),proper(X2),proper(X3)) PROPER(if(X1,X2,X3)) -> PROPER(X1) PROPER(if(X1,X2,X3)) -> PROPER(X2) PROPER(if(X1,X2,X3)) -> PROPER(X3)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472