details

property	value
status	complete
benchmark	Ex6_GM04_FR.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n136.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	61.1160550117 seconds
cpu usage	60.389501791
max memory	4141056.0

stage attributes

key	value
output-size	1858
starexec-result	NO

output

/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Problem 1: (VAR v_NonEmpty:S X:S) (RULES activate(n__c) -> c activate(n__g(X:S)) -> g(X:S) activate(X:S) -> X:S c -> f(n__g(n__c)) c -> n__c f(n__g(X:S)) -> g(activate(X:S)) g(X:S) -> n__g(X:S) ) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVATE(n__c) -> C ACTIVATE(n__g(X:S)) -> G(X:S) C -> F(n__g(n__c)) F(n__g(X:S)) -> ACTIVATE(X:S) F(n__g(X:S)) -> G(activate(X:S)) -> Rules: activate(n__c) -> c activate(n__g(X:S)) -> g(X:S) activate(X:S) -> X:S c -> f(n__g(n__c)) c -> n__c f(n__g(X:S)) -> g(activate(X:S)) g(X:S) -> n__g(X:S) Problem 1: SCC Processor: -> Pairs: ACTIVATE(n__c) -> C ACTIVATE(n__g(X:S)) -> G(X:S) C -> F(n__g(n__c)) F(n__g(X:S)) -> ACTIVATE(X:S) F(n__g(X:S)) -> G(activate(X:S)) -> Rules: activate(n__c) -> c activate(n__g(X:S)) -> g(X:S) activate(X:S) -> X:S c -> f(n__g(n__c)) c -> n__c f(n__g(X:S)) -> g(activate(X:S)) g(X:S) -> n__g(X:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVATE(n__c) -> C C -> F(n__g(n__c)) F(n__g(X:S)) -> ACTIVATE(X:S) ->->-> Rules: activate(n__c) -> c activate(n__g(X:S)) -> g(X:S) activate(X:S) -> X:S c -> f(n__g(n__c)) c -> n__c f(n__g(X:S)) -> g(activate(X:S)) g(X:S) -> n__g(X:S) Problem 1: Infinite Processor: -> Pairs: ACTIVATE(n__c) -> C C -> F(n__g(n__c)) F(n__g(X:S)) -> ACTIVATE(X:S) -> Rules: activate(n__c) -> c activate(n__g(X:S)) -> g(X:S) activate(X:S) -> X:S c -> f(n__g(n__c)) c -> n__c f(n__g(X:S)) -> g(activate(X:S)) g(X:S) -> n__g(X:S) -> Pairs in cycle: ACTIVATE(n__c) -> C C -> F(n__g(n__c)) F(n__g(n__c)) -> ACTIVATE(n__c) The problem is infinite. popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard