Higher_Order_Rewriting_Union_Beta 2019-03-28 22.10 pair #432270535

details

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

run statistics

property	value
solver	Wanda 2.1c
configuration	default
runtime (wallclock)	0.00913206 seconds
cpu usage	0.004524
user time	0.002262
system time	0.002262
max virtual memory	0.0
max residence set size	1480.0

stage attributes

key	value
starexec-result	YES

output

0.00/0.00	YES
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	    uncurry : [a -> b -> c * a * b] --> c 
0.00/0.00	
0.00/0.00	  Rules:
0.00/0.00	
0.00/0.00	    uncurry(f, x, y) => f 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	Symbol uncurry is an encoding for application that is only used in innocuous ways.  We can simplify the program (without losing non-termination) by removing it.  This gives:
0.00/0.00	
0.00/0.00	  Alphabet:
0.00/0.00	
0.00/0.00	
0.00/0.00	  Rules:
0.00/0.00	
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