Higher_Order_Rewriting_Union_Beta 2019-03-28 22.10 pair #432270293

details

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

run statistics

property	value
solver	Wanda 2.1c
configuration	default
runtime (wallclock)	0.0113801 seconds
cpu usage	0.004914
user time	0.002457
system time	0.002457
max virtual memory	0.0
max residence set size	1384.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	    fapp : [o * o] --> o 
0.00/0.00	    lam : [o -> o] --> o 
0.00/0.00	
0.00/0.00	  Rules:
0.00/0.00	
0.00/0.00	    fapp(lam(f), x) => f x 
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	  fapp(lam(/\x.fapp(x, x)), lam(/\y.fapp(y, y))) 
0.00/0.00	    => (/\x.fapp(x, x)) lam(/\y.fapp(y, y)) 
0.00/0.00	    =>_beta fapp(lam(/\x.fapp(x, x)), lam(/\y.fapp(y, y))) 
0.00/0.00	
0.00/0.00	That is, a term reduces to itself.
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