Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Equat 89423 pair #381732613
details
property
value
status
complete
benchmark
kusakari1.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n052.star.cs.uiowa.edu
space
Mixed_AC
run statistics
property
value
solver
muterm 5.18
configuration
default
runtime (wallclock)
0.270412921906 seconds
cpu usage
0.239467217
max memory
4374528.0
stage attributes
key
value
output-size
9252
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 y) (THEORY (AC +)) (RULES +(g(x),g(y)) -> g(+(g(a),+(x,y))) ) Problem 1: Dependency Pairs Processor: -> FAxioms: +#(+(x2,x3),x4) = +#(x2,+(x3,x4)) +#(x2,x3) = +#(x3,x2) -> Pairs: +#(+(g(x),g(y)),x2) -> +#(g(+(g(a),+(x,y))),x2) +#(+(g(x),g(y)),x2) -> +#(g(a),+(x,y)) +#(+(g(x),g(y)),x2) -> +#(x,y) +#(g(x),g(y)) -> +#(g(a),+(x,y)) +#(g(x),g(y)) -> +#(x,y) -> EAxioms: +(+(x2,x3),x4) = +(x2,+(x3,x4)) +(x2,x3) = +(x3,x2) -> Rules: +(g(x),g(y)) -> g(+(g(a),+(x,y))) -> SRules: +#(+(x2,x3),x4) -> +#(x2,x3) +#(x2,+(x3,x4)) -> +#(x3,x4) Problem 1: SCC Processor: -> FAxioms: +#(+(x2,x3),x4) = +#(x2,+(x3,x4)) +#(x2,x3) = +#(x3,x2) -> Pairs: +#(+(g(x),g(y)),x2) -> +#(g(+(g(a),+(x,y))),x2) +#(+(g(x),g(y)),x2) -> +#(g(a),+(x,y)) +#(+(g(x),g(y)),x2) -> +#(x,y) +#(g(x),g(y)) -> +#(g(a),+(x,y)) +#(g(x),g(y)) -> +#(x,y) -> EAxioms: +(+(x2,x3),x4) = +(x2,+(x3,x4)) +(x2,x3) = +(x3,x2) -> Rules: +(g(x),g(y)) -> g(+(g(a),+(x,y))) -> SRules: +#(+(x2,x3),x4) -> +#(x2,x3) +#(x2,+(x3,x4)) -> +#(x3,x4) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: +#(+(g(x),g(y)),x2) -> +#(g(+(g(a),+(x,y))),x2) +#(+(g(x),g(y)),x2) -> +#(g(a),+(x,y)) +#(+(g(x),g(y)),x2) -> +#(x,y) +#(g(x),g(y)) -> +#(g(a),+(x,y)) +#(g(x),g(y)) -> +#(x,y) -> FAxioms: +(+(x2,x3),x4) -> +(x2,+(x3,x4)) +(x2,x3) -> +(x3,x2) +#(+(x2,x3),x4) -> +#(x2,+(x3,x4)) +#(x2,x3) -> +#(x3,x2) -> EAxioms: +(+(x2,x3),x4) = +(x2,+(x3,x4)) +(x2,x3) = +(x3,x2) ->->-> Rules: +(g(x),g(y)) -> g(+(g(a),+(x,y))) -> SRules: +#(+(x2,x3),x4) -> +#(x2,x3) +#(x2,+(x3,x4)) -> +#(x3,x4) Problem 1: Reduction Pairs Processor: -> FAxioms: +#(+(x2,x3),x4) = +#(x2,+(x3,x4)) +#(x2,x3) = +#(x3,x2) -> Pairs: +#(+(g(x),g(y)),x2) -> +#(g(+(g(a),+(x,y))),x2) +#(+(g(x),g(y)),x2) -> +#(g(a),+(x,y)) +#(+(g(x),g(y)),x2) -> +#(x,y) +#(g(x),g(y)) -> +#(g(a),+(x,y)) +#(g(x),g(y)) -> +#(x,y) -> EAxioms: +(+(x2,x3),x4) = +(x2,+(x3,x4)) +(x2,x3) = +(x3,x2) -> Usable Equations: +(+(x2,x3),x4) = +(x2,+(x3,x4)) +(x2,x3) = +(x3,x2) -> Rules: +(g(x),g(y)) -> g(+(g(a),+(x,y)))
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Equat 89423