details

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

run statistics

property	value
solver	muterm 6.0.3
configuration	default
runtime (wallclock)	80.5406479836 seconds
cpu usage	80.470368163
max memory	4583424.0

stage attributes

key	value
output-size	2281
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 x:S y:S z:S) (RULES a -> b a -> c f(x:S,y:S,z:S) -> g(x:S,y:S,z:S) g(0,1,x:S) -> f(x:S,x:S,x:S) ) Problem 1: Dependency Pairs Processor: -> Pairs: F(x:S,y:S,z:S) -> G(x:S,y:S,z:S) G(0,1,x:S) -> F(x:S,x:S,x:S) -> Rules: a -> b a -> c f(x:S,y:S,z:S) -> g(x:S,y:S,z:S) g(0,1,x:S) -> f(x:S,x:S,x:S) Problem 1: SCC Processor: -> Pairs: F(x:S,y:S,z:S) -> G(x:S,y:S,z:S) G(0,1,x:S) -> F(x:S,x:S,x:S) -> Rules: a -> b a -> c f(x:S,y:S,z:S) -> g(x:S,y:S,z:S) g(0,1,x:S) -> f(x:S,x:S,x:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(x:S,y:S,z:S) -> G(x:S,y:S,z:S) G(0,1,x:S) -> F(x:S,x:S,x:S) ->->-> Rules: a -> b a -> c f(x:S,y:S,z:S) -> g(x:S,y:S,z:S) g(0,1,x:S) -> f(x:S,x:S,x:S) Problem 1: Forward Instantiation Processor: -> Pairs: F(x:S,y:S,z:S) -> G(x:S,y:S,z:S) G(0,1,x:S) -> F(x:S,x:S,x:S) -> Rules: a -> b a -> c f(x:S,y:S,z:S) -> g(x:S,y:S,z:S) g(0,1,x:S) -> f(x:S,x:S,x:S) ->Instantiated Pairs: ->->Original Pair: F(x:S,y:S,z:S) -> G(x:S,y:S,z:S) ->-> Instantiated pairs: F(0,1,z:S) -> G(0,1,z:S) Problem 1: SCC Processor: -> Pairs: F(0,1,z:S) -> G(0,1,z:S) G(0,1,x:S) -> F(x:S,x:S,x:S) -> Rules: a -> b a -> c f(x:S,y:S,z:S) -> g(x:S,y:S,z:S) g(0,1,x:S) -> f(x:S,x:S,x:S) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: F(0,1,z:S) -> G(0,1,z:S) G(0,1,x:S) -> F(x:S,x:S,x:S) ->->-> Rules: a -> b a -> c f(x:S,y:S,z:S) -> g(x:S,y:S,z:S) g(0,1,x:S) -> f(x:S,x:S,x:S) Problem 1: Forward Instantiation Processor: -> Pairs: F(0,1,z:S) -> G(0,1,z:S) G(0,1,x:S) -> F(x:S,x:S,x:S) -> Rules: a -> b a -> c popout

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

job log

popout

actions

all output return to TRS Standard