Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381718926
details
property
value
status
complete
benchmark
aprove00.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
Secret_06_SRS
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.113974094391 seconds
cpu usage
0.091396018
max memory
4182016.0
stage attributes
key
value
output-size
4078
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 x1) (RULES a(s(x1)) -> s(s(s(p(s(b(p(p(s(s(x1)))))))))) b(s(x1)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1)))))))))))) c(s(x1)) -> p(s(p(s(a(p(s(p(s(x1))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 ) Problem 1: Dependency Pairs Processor: -> Pairs: A(s(x1)) -> B(p(p(s(s(x1))))) A(s(x1)) -> P(p(s(s(x1)))) A(s(x1)) -> P(s(b(p(p(s(s(x1))))))) A(s(x1)) -> P(s(s(x1))) B(s(x1)) -> C(p(s(p(s(x1))))) B(s(x1)) -> P(p(s(s(c(p(s(p(s(x1))))))))) B(s(x1)) -> P(s(p(s(x1)))) B(s(x1)) -> P(s(s(c(p(s(p(s(x1)))))))) B(s(x1)) -> P(s(x1)) C(s(x1)) -> A(p(s(p(s(x1))))) C(s(x1)) -> P(s(a(p(s(p(s(x1))))))) C(s(x1)) -> P(s(p(s(a(p(s(p(s(x1))))))))) C(s(x1)) -> P(s(p(s(x1)))) C(s(x1)) -> P(s(x1)) P(p(s(x1))) -> P(x1) -> Rules: a(s(x1)) -> s(s(s(p(s(b(p(p(s(s(x1)))))))))) b(s(x1)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1)))))))))))) c(s(x1)) -> p(s(p(s(a(p(s(p(s(x1))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 Problem 1: SCC Processor: -> Pairs: A(s(x1)) -> B(p(p(s(s(x1))))) A(s(x1)) -> P(p(s(s(x1)))) A(s(x1)) -> P(s(b(p(p(s(s(x1))))))) A(s(x1)) -> P(s(s(x1))) B(s(x1)) -> C(p(s(p(s(x1))))) B(s(x1)) -> P(p(s(s(c(p(s(p(s(x1))))))))) B(s(x1)) -> P(s(p(s(x1)))) B(s(x1)) -> P(s(s(c(p(s(p(s(x1)))))))) B(s(x1)) -> P(s(x1)) C(s(x1)) -> A(p(s(p(s(x1))))) C(s(x1)) -> P(s(a(p(s(p(s(x1))))))) C(s(x1)) -> P(s(p(s(a(p(s(p(s(x1))))))))) C(s(x1)) -> P(s(p(s(x1)))) C(s(x1)) -> P(s(x1)) P(p(s(x1))) -> P(x1) -> Rules: a(s(x1)) -> s(s(s(p(s(b(p(p(s(s(x1)))))))))) b(s(x1)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1)))))))))))) c(s(x1)) -> p(s(p(s(a(p(s(p(s(x1))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: P(p(s(x1))) -> P(x1) ->->-> Rules: a(s(x1)) -> s(s(s(p(s(b(p(p(s(s(x1)))))))))) b(s(x1)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1)))))))))))) c(s(x1)) -> p(s(p(s(a(p(s(p(s(x1))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 ->->Cycle: ->->-> Pairs: A(s(x1)) -> B(p(p(s(s(x1))))) B(s(x1)) -> C(p(s(p(s(x1))))) C(s(x1)) -> A(p(s(p(s(x1))))) ->->-> Rules: a(s(x1)) -> s(s(s(p(s(b(p(p(s(s(x1)))))))))) b(s(x1)) -> s(s(s(p(p(s(s(c(p(s(p(s(x1)))))))))))) c(s(x1)) -> p(s(p(s(a(p(s(p(s(x1))))))))) p(p(s(x1))) -> p(x1) p(s(x1)) -> x1 The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: P(p(s(x1))) -> P(x1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685