details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	72.5370688438 seconds
cpu usage	72.409073162
max memory	6.7694592E7

stage attributes

key	value
output-size	6028
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 x':S y:S y':S z:S) (RULES fib(0) -> pair(0,s(0)) fib(s(x:S)) -> pair(z:S,plus(y:S,z:S)) | fib(x:S) ->* pair(y:S,z:S) plus(x:S,y:S) -> s(plus(x':S,y':S)) | x:S ->* s(x':S), y:S ->* y':S plus(x:S,y:S) -> y':S | x:S ->* 0, y:S ->* y':S ) Problem 1: Valid CTRS Processor: -> Rules: fib(0) -> pair(0,s(0)) fib(s(x:S)) -> pair(z:S,plus(y:S,z:S)) | fib(x:S) ->* pair(y:S,z:S) plus(x:S,y:S) -> s(plus(x':S,y':S)) | x:S ->* s(x':S), y:S ->* y':S plus(x:S,y:S) -> y':S | x:S ->* 0, y:S ->* y':S -> The system is a deterministic 3-CTRS. Problem 1: Dependency Pairs Processor: Conditional Termination Problem 1: -> Pairs: FIB(s(x:S)) -> PLUS(y:S,z:S) | fib(x:S) ->* pair(y:S,z:S) PLUS(x:S,y:S) -> PLUS(x':S,y':S) | x:S ->* s(x':S), y:S ->* y':S -> QPairs: Empty -> Rules: fib(0) -> pair(0,s(0)) fib(s(x:S)) -> pair(z:S,plus(y:S,z:S)) | fib(x:S) ->* pair(y:S,z:S) plus(x:S,y:S) -> s(plus(x':S,y':S)) | x:S ->* s(x':S), y:S ->* y':S plus(x:S,y:S) -> y':S | x:S ->* 0, y:S ->* y':S Conditional Termination Problem 2: -> Pairs: FIB(s(x:S)) -> FIB(x:S) -> QPairs: FIB(s(x:S)) -> PLUS(y:S,z:S) | fib(x:S) ->* pair(y:S,z:S) PLUS(x:S,y:S) -> PLUS(x':S,y':S) | x:S ->* s(x':S), y:S ->* y':S -> Rules: fib(0) -> pair(0,s(0)) fib(s(x:S)) -> pair(z:S,plus(y:S,z:S)) | fib(x:S) ->* pair(y:S,z:S) plus(x:S,y:S) -> s(plus(x':S,y':S)) | x:S ->* s(x':S), y:S ->* y':S plus(x:S,y:S) -> y':S | x:S ->* 0, y:S ->* y':S The problem is decomposed in 2 subproblems. Problem 1.1: SCC Processor: -> Pairs: FIB(s(x:S)) -> PLUS(y:S,z:S) | fib(x:S) ->* pair(y:S,z:S) PLUS(x:S,y:S) -> PLUS(x':S,y':S) | x:S ->* s(x':S), y:S ->* y':S -> QPairs: Empty -> Rules: fib(0) -> pair(0,s(0)) fib(s(x:S)) -> pair(z:S,plus(y:S,z:S)) | fib(x:S) ->* pair(y:S,z:S) plus(x:S,y:S) -> s(plus(x':S,y':S)) | x:S ->* s(x':S), y:S ->* y':S plus(x:S,y:S) -> y':S | x:S ->* 0, y:S ->* y':S ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(x:S,y:S) -> PLUS(x':S,y':S) | x:S ->* s(x':S), y:S ->* y':S -> QPairs: Empty ->->-> Rules: fib(0) -> pair(0,s(0)) fib(s(x:S)) -> pair(z:S,plus(y:S,z:S)) | fib(x:S) ->* pair(y:S,z:S) plus(x:S,y:S) -> s(plus(x':S,y':S)) | x:S ->* s(x':S), y:S ->* y':S plus(x:S,y:S) -> y':S | x:S ->* 0, y:S ->* y':S Problem 1.1: Simplifying Unifiable Condition Processor: -> Pairs: PLUS(x:S,y:S) -> PLUS(x':S,y':S) | x:S ->* s(x':S), y:S ->* y':S -> QPairs: Empty -> Rules: fib(0) -> pair(0,s(0)) fib(s(x:S)) -> pair(z:S,plus(y:S,z:S)) | fib(x:S) ->* pair(y:S,z:S) plus(x:S,y:S) -> s(plus(x':S,y':S)) | x:S ->* s(x':S), y:S ->* y':S plus(x:S,y:S) -> y':S | x:S ->* 0, y:S ->* y':S ->Transformed Pairs/Rules: ->->Original Pair/Rule: PLUS(x:S,y:S) -> PLUS(x':S,y':S) | x:S ->* s(x':S), y:S ->* y':S ->-> Transformed Pair/Rule: PLUS(s(x':S),y':S) -> PLUS(x':S,y':S) popout

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

job log

popout

actions

all output return to TRS Conditional