details

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

run statistics

property	value
solver	Wanda
configuration	HigherOrder
runtime (wallclock)	1.16583395004 seconds
cpu usage	1.162031573
max memory	1.01810176E8

stage attributes

key	value
output-size	1378
starexec-result	MAYBE

output

/export/starexec/sandbox2/solver/bin/starexec_run_HigherOrder /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE We consider the system theBenchmark. Alphabet: 0 : [] --> N rec : [] --> N -> N -> B -> N -> B -> B -> N -> B s : [] --> N -> N Rules: rec f (g 0) => g rec f (g (s x)) => f x (rec f (g x)) Using the transformations described in [Kop11], this system can be brought in a form without leading free variables in the left-hand side, and where the left-hand side of a variable is always a functional term or application headed by a functional term. We now transform the resulting AFS into an AFSM by replacing all free variables by meta-variables (with arity 0). This leads to the following AFSM: Alphabet: 0 : [] --> N rec : [N -> N -> B -> N -> B * B] --> N -> B s : [N] --> N ~AP1 : [N -> B * N] --> B Rules: rec(F, ~AP1(G, 0)) => G rec(F, ~AP1(G, s(X))) => F X rec(F, ~AP1(G, X)) rec(F, rec(G, X) 0) => rec(G, X) rec(F, rec(G, X) s(Y)) => F Y rec(F, rec(G, X) Y) ~AP1(F, X) => F X +++ Citations +++ [Kop11] C. Kop. Simplifying Algebraic Functional Systems. In Proceedings of CAI 2011, volume 6742 of LNCS. 201--215, Springer, 2011. popout

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

job log

popout

actions

all output return to HRS union beta 16688