Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #516968958
details
property
value
status
complete
benchmark
z125.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n083.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
muterm 6.0.3
configuration
default
runtime (wallclock)
101.580456018 seconds
cpu usage
100.652729584
max memory
1.05734144E8
stage attributes
key
value
output-size
10345
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 v_NonEmpty:S x1:S) (RULES c(c(x1:S)) -> c(x1:S) c(f(x1:S)) -> f(n(a(c(x1:S)))) f(x1:S) -> n(c(n(a(x1:S)))) n(f(x1:S)) -> f(n(x1:S)) n(a(x1:S)) -> c(x1:S) n(s(x1:S)) -> f(s(s(x1:S))) ) Problem 1: Dependency Pairs Processor: -> Pairs: C(f(x1:S)) -> C(x1:S) C(f(x1:S)) -> F(n(a(c(x1:S)))) C(f(x1:S)) -> N(a(c(x1:S))) F(x1:S) -> C(n(a(x1:S))) F(x1:S) -> N(c(n(a(x1:S)))) F(x1:S) -> N(a(x1:S)) N(f(x1:S)) -> F(n(x1:S)) N(f(x1:S)) -> N(x1:S) N(a(x1:S)) -> C(x1:S) N(s(x1:S)) -> F(s(s(x1:S))) -> Rules: c(c(x1:S)) -> c(x1:S) c(f(x1:S)) -> f(n(a(c(x1:S)))) f(x1:S) -> n(c(n(a(x1:S)))) n(f(x1:S)) -> f(n(x1:S)) n(a(x1:S)) -> c(x1:S) n(s(x1:S)) -> f(s(s(x1:S))) Problem 1: SCC Processor: -> Pairs: C(f(x1:S)) -> C(x1:S) C(f(x1:S)) -> F(n(a(c(x1:S)))) C(f(x1:S)) -> N(a(c(x1:S))) F(x1:S) -> C(n(a(x1:S))) F(x1:S) -> N(c(n(a(x1:S)))) F(x1:S) -> N(a(x1:S)) N(f(x1:S)) -> F(n(x1:S)) N(f(x1:S)) -> N(x1:S) N(a(x1:S)) -> C(x1:S) N(s(x1:S)) -> F(s(s(x1:S))) -> Rules: c(c(x1:S)) -> c(x1:S) c(f(x1:S)) -> f(n(a(c(x1:S)))) f(x1:S) -> n(c(n(a(x1:S)))) n(f(x1:S)) -> f(n(x1:S)) n(a(x1:S)) -> c(x1:S) n(s(x1:S)) -> f(s(s(x1:S))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: C(f(x1:S)) -> C(x1:S) C(f(x1:S)) -> F(n(a(c(x1:S)))) C(f(x1:S)) -> N(a(c(x1:S))) F(x1:S) -> C(n(a(x1:S))) F(x1:S) -> N(c(n(a(x1:S)))) F(x1:S) -> N(a(x1:S)) N(f(x1:S)) -> F(n(x1:S)) N(f(x1:S)) -> N(x1:S) N(a(x1:S)) -> C(x1:S) N(s(x1:S)) -> F(s(s(x1:S))) ->->-> Rules: c(c(x1:S)) -> c(x1:S) c(f(x1:S)) -> f(n(a(c(x1:S)))) f(x1:S) -> n(c(n(a(x1:S)))) n(f(x1:S)) -> f(n(x1:S)) n(a(x1:S)) -> c(x1:S) n(s(x1:S)) -> f(s(s(x1:S))) Problem 1: Reduction Pair Processor: -> Pairs: C(f(x1:S)) -> C(x1:S) C(f(x1:S)) -> F(n(a(c(x1:S)))) C(f(x1:S)) -> N(a(c(x1:S))) F(x1:S) -> C(n(a(x1:S))) F(x1:S) -> N(c(n(a(x1:S)))) F(x1:S) -> N(a(x1:S)) N(f(x1:S)) -> F(n(x1:S)) N(f(x1:S)) -> N(x1:S) N(a(x1:S)) -> C(x1:S) N(s(x1:S)) -> F(s(s(x1:S))) -> Rules: c(c(x1:S)) -> c(x1:S)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard