Higher_Order_Rewriting_Union_Beta 2019-03-28 22.10 pair #432270229

details

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

run statistics

property	value
solver	Wanda 2.1c
configuration	default
runtime (wallclock)	0.00966709 seconds
cpu usage	0.005796
user time	0.002576
system time	0.00322
max virtual memory	0.0
max residence set size	1408.0

stage attributes

key	value
starexec-result	NO

output

0.00/0.00	NO
0.00/0.00	We consider the system theBenchmark.
0.00/0.00	
0.00/0.00	  Alphabet:
0.00/0.00	
0.00/0.00	    f : [d -> d * b] --> c 
0.00/0.00	    g : [b * a] --> d -> d 
0.00/0.00	    h : [a -> b -> c] --> b 
0.00/0.00	    i : [c] --> c 
0.00/0.00	
0.00/0.00	  Rules:
0.00/0.00	
0.00/0.00	    f(g(h(j), x), y) => i(j x y) 
0.00/0.00	
0.00/0.00	This AFS is converted to an AFSM simply by replacing all free variables by meta-variables (with arity 0).
0.00/0.00	
0.00/0.00	This system is non-terminating, as demonstrated by the following reduction:
0.00/0.00	
0.00/0.00	  f(g(h(/\x./\y.f(g(y, x), y)), z), h(/\u./\v.f(g(v, u), v))) 
0.00/0.00	    => i((/\x./\y.f(g(y, x), y)) z h(/\u./\v.f(g(v, u), v))) 
0.00/0.00	    =>_beta i(f(g(h(/\x./\y.f(g(y, x), y)), z), h(/\u./\v.f(g(v, u), v)))) 
0.00/0.00	
0.00/0.00	That is, a term s reduces to a term of the form C[s].
0.00/0.00	
0.00/0.00	EOF

popout

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

job log

popout

actions all output return to Higher_Order_Rewriting_Union_Beta 2019-03-28 22.10