Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516963911
details
property
value
status
complete
benchmark
Liveness8.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n172.star.cs.uiowa.edu
space
AProVE_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
0.174663066864 seconds
cpu usage
0.120051523
max memory
4415488.0
stage attributes
key
value
output-size
19626
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 v_NonEmpty:S x:S y:S) (RULES active(f(x:S)) -> f(active(x:S)) active(f(x:S)) -> mark(x:S) check(f(x:S)) -> f(check(x:S)) check(x:S) -> start(match(f(X),x:S)) f(found(x:S)) -> found(f(x:S)) f(mark(x:S)) -> mark(f(x:S)) f(ok(x:S)) -> ok(f(x:S)) match(f(x:S),f(y:S)) -> f(match(x:S,y:S)) match(X,x:S) -> proper(x:S) proper(f(x:S)) -> f(proper(x:S)) proper(c) -> ok(c) start(ok(x:S)) -> found(x:S) top(active(c)) -> top(mark(c)) top(found(x:S)) -> top(active(x:S)) top(mark(x:S)) -> top(check(x:S)) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(f(x:S)) -> ACTIVE(x:S) ACTIVE(f(x:S)) -> F(active(x:S)) CHECK(f(x:S)) -> CHECK(x:S) CHECK(f(x:S)) -> F(check(x:S)) CHECK(x:S) -> MATCH(f(X),x:S) CHECK(x:S) -> START(match(f(X),x:S)) F(found(x:S)) -> F(x:S) F(mark(x:S)) -> F(x:S) F(ok(x:S)) -> F(x:S) MATCH(f(x:S),f(y:S)) -> F(match(x:S,y:S)) MATCH(f(x:S),f(y:S)) -> MATCH(x:S,y:S) MATCH(X,x:S) -> PROPER(x:S) PROPER(f(x:S)) -> F(proper(x:S)) PROPER(f(x:S)) -> PROPER(x:S) TOP(active(c)) -> TOP(mark(c)) TOP(found(x:S)) -> ACTIVE(x:S) TOP(found(x:S)) -> TOP(active(x:S)) TOP(mark(x:S)) -> CHECK(x:S) TOP(mark(x:S)) -> TOP(check(x:S)) -> Rules: active(f(x:S)) -> f(active(x:S)) active(f(x:S)) -> mark(x:S) check(f(x:S)) -> f(check(x:S)) check(x:S) -> start(match(f(X),x:S)) f(found(x:S)) -> found(f(x:S)) f(mark(x:S)) -> mark(f(x:S)) f(ok(x:S)) -> ok(f(x:S)) match(f(x:S),f(y:S)) -> f(match(x:S,y:S)) match(X,x:S) -> proper(x:S) proper(f(x:S)) -> f(proper(x:S)) proper(c) -> ok(c) start(ok(x:S)) -> found(x:S) top(active(c)) -> top(mark(c)) top(found(x:S)) -> top(active(x:S)) top(mark(x:S)) -> top(check(x:S)) Problem 1: SCC Processor: -> Pairs: ACTIVE(f(x:S)) -> ACTIVE(x:S) ACTIVE(f(x:S)) -> F(active(x:S)) CHECK(f(x:S)) -> CHECK(x:S) CHECK(f(x:S)) -> F(check(x:S)) CHECK(x:S) -> MATCH(f(X),x:S) CHECK(x:S) -> START(match(f(X),x:S)) F(found(x:S)) -> F(x:S) F(mark(x:S)) -> F(x:S) F(ok(x:S)) -> F(x:S) MATCH(f(x:S),f(y:S)) -> F(match(x:S,y:S)) MATCH(f(x:S),f(y:S)) -> MATCH(x:S,y:S) MATCH(X,x:S) -> PROPER(x:S) PROPER(f(x:S)) -> F(proper(x:S)) PROPER(f(x:S)) -> PROPER(x:S) TOP(active(c)) -> TOP(mark(c)) TOP(found(x:S)) -> ACTIVE(x:S) TOP(found(x:S)) -> TOP(active(x:S)) TOP(mark(x:S)) -> CHECK(x:S) TOP(mark(x:S)) -> TOP(check(x:S)) -> Rules: active(f(x:S)) -> f(active(x:S)) active(f(x:S)) -> mark(x:S) check(f(x:S)) -> f(check(x:S)) check(x:S) -> start(match(f(X),x:S)) f(found(x:S)) -> found(f(x:S)) f(mark(x:S)) -> mark(f(x:S)) f(ok(x:S)) -> ok(f(x:S))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard