Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS union beta 16688 pair #381734465
details
property
value
status
complete
benchmark
h17.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n033.star.cs.uiowa.edu
space
Hamana_Kikuchi_18
run statistics
property
value
solver
Wanda
configuration
HigherOrder
runtime (wallclock)
145.197537899 seconds
cpu usage
145.186880249
max memory
2.536951808E9
stage attributes
key
value
output-size
2343
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_HigherOrder /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE We consider the system theBenchmark. Alphabet: cons : [] --> a -> alist -> alist map : [] --> a -> a -> alist -> alist nil : [] --> alist o : [] --> a -> a -> a -> a -> a -> a Rules: map (/\x.f x) nil => nil map (/\x.f x) (cons y z) => cons (f y) (map (/\u.f u) z) map (/\x.f x) (map (/\y.g y) z) => map (/\u.o (/\v.f v) (/\w.g w) u) z o (/\x.f x) (/\y.g y) z => f (g z) 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: cons : [a * alist] --> alist map : [a -> a * alist] --> alist nil : [] --> alist o : [a -> a * a -> a * a] --> a ~AP1 : [a -> a * a] --> a Rules: map(/\x.~AP1(F, x), nil) => nil map(/\x.~AP1(F, x), cons(X, Y)) => cons(~AP1(F, X), map(/\y.~AP1(F, y), Y)) map(/\x.~AP1(F, x), map(/\y.~AP1(G, y), X)) => map(/\z.o(/\u.~AP1(F, u), /\v.~AP1(G, v), z), X) o(/\x.~AP1(F, x), /\y.~AP1(G, y), X) => ~AP1(F, ~AP1(G, X)) map(/\x.o(F, G, x), nil) => nil map(/\x.o(F, G, x), cons(X, Y)) => cons(o(F, G, X), map(/\y.o(F, G, y), Y)) map(/\x.o(F, G, x), map(/\y.~AP1(H, y), X)) => map(/\z.o(/\u.o(F, G, u), /\v.~AP1(H, v), z), X) map(/\x.~AP1(F, x), map(/\y.o(G, H, y), X)) => map(/\z.o(/\u.~AP1(F, u), /\v.o(G, H, v), z), X) o(/\x.o(F, G, x), /\y.~AP1(H, y), X) => o(F, G, ~AP1(H, X)) o(/\x.~AP1(F, x), /\y.o(G, H, y), X) => ~AP1(F, o(G, H, X)) map(/\x.o(F, G, x), map(/\y.o(H, I, y), X)) => map(/\z.o(/\u.o(F, G, u), /\v.o(H, I, v), z), X) o(/\x.o(F, G, x), /\y.o(H, I, y), X) => o(F, G, o(H, I, X)) ~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