Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381716766
details
property
value
status
complete
benchmark
Ex15_Luc98_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.145325899124 seconds
cpu usage
0.145633416
max memory
7102464.0
stage attributes
key
value
output-size
72312
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 Z) (RULES active(add(s(X),Y)) -> mark(s(add(X,Y))) active(add(0,X)) -> mark(X) active(add(X1,X2)) -> add(active(X1),X2) active(and(false,Y)) -> mark(false) active(and(true,X)) -> mark(X) active(and(X1,X2)) -> and(active(X1),X2) active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) active(first(0,X)) -> mark(nil) active(first(X1,X2)) -> first(active(X1),X2) active(first(X1,X2)) -> first(X1,active(X2)) active(from(X)) -> mark(cons(X,from(s(X)))) active(if(false,X,Y)) -> mark(Y) active(if(true,X,Y)) -> mark(X) active(if(X1,X2,X3)) -> if(active(X1),X2,X3) add(mark(X1),X2) -> mark(add(X1,X2)) add(ok(X1),ok(X2)) -> ok(add(X1,X2)) and(mark(X1),X2) -> mark(and(X1,X2)) and(ok(X1),ok(X2)) -> ok(and(X1,X2)) cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) first(mark(X1),X2) -> mark(first(X1,X2)) first(ok(X1),ok(X2)) -> ok(first(X1,X2)) first(X1,mark(X2)) -> mark(first(X1,X2)) from(ok(X)) -> ok(from(X)) if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) proper(add(X1,X2)) -> add(proper(X1),proper(X2)) proper(and(X1,X2)) -> and(proper(X1),proper(X2)) proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) proper(first(X1,X2)) -> first(proper(X1),proper(X2)) proper(from(X)) -> from(proper(X)) proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) proper(s(X)) -> s(proper(X)) proper(0) -> ok(0) proper(false) -> ok(false) proper(nil) -> ok(nil) proper(true) -> ok(true) s(ok(X)) -> ok(s(X)) top(mark(X)) -> top(proper(X)) top(ok(X)) -> top(active(X)) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(add(s(X),Y)) -> ADD(X,Y) ACTIVE(add(s(X),Y)) -> S(add(X,Y)) ACTIVE(add(X1,X2)) -> ACTIVE(X1) ACTIVE(add(X1,X2)) -> ADD(active(X1),X2) ACTIVE(and(X1,X2)) -> ACTIVE(X1) ACTIVE(and(X1,X2)) -> AND(active(X1),X2) ACTIVE(first(s(X),cons(Y,Z))) -> CONS(Y,first(X,Z)) ACTIVE(first(s(X),cons(Y,Z))) -> FIRST(X,Z) ACTIVE(first(X1,X2)) -> ACTIVE(X1) ACTIVE(first(X1,X2)) -> ACTIVE(X2) ACTIVE(first(X1,X2)) -> FIRST(active(X1),X2) ACTIVE(first(X1,X2)) -> FIRST(X1,active(X2)) ACTIVE(from(X)) -> CONS(X,from(s(X))) ACTIVE(from(X)) -> FROM(s(X)) ACTIVE(from(X)) -> S(X) ACTIVE(if(X1,X2,X3)) -> ACTIVE(X1) ACTIVE(if(X1,X2,X3)) -> IF(active(X1),X2,X3) ADD(mark(X1),X2) -> ADD(X1,X2) ADD(ok(X1),ok(X2)) -> ADD(X1,X2) AND(mark(X1),X2) -> AND(X1,X2) AND(ok(X1),ok(X2)) -> AND(X1,X2) CONS(ok(X1),ok(X2)) -> CONS(X1,X2) FIRST(mark(X1),X2) -> FIRST(X1,X2) FIRST(ok(X1),ok(X2)) -> FIRST(X1,X2) FIRST(X1,mark(X2)) -> FIRST(X1,X2) FROM(ok(X)) -> FROM(X) IF(mark(X1),X2,X3) -> IF(X1,X2,X3) IF(ok(X1),ok(X2),ok(X3)) -> IF(X1,X2,X3) PROPER(add(X1,X2)) -> ADD(proper(X1),proper(X2)) PROPER(add(X1,X2)) -> PROPER(X1) PROPER(add(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(cons(X1,X2)) -> CONS(proper(X1),proper(X2)) PROPER(cons(X1,X2)) -> PROPER(X1) PROPER(cons(X1,X2)) -> PROPER(X2) PROPER(first(X1,X2)) -> FIRST(proper(X1),proper(X2)) PROPER(first(X1,X2)) -> PROPER(X1) PROPER(first(X1,X2)) -> PROPER(X2) PROPER(from(X)) -> FROM(proper(X)) PROPER(from(X)) -> PROPER(X) PROPER(if(X1,X2,X3)) -> IF(proper(X1),proper(X2),proper(X3))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472