Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS 58631 pair #381918920
details
property
value
status
complete
benchmark
DicosmoKesner93.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n029.star.cs.uiowa.edu
space
Hamana_17
run statistics
property
value
solver
sol 37957
configuration
hrs
runtime (wallclock)
0.019583940506 seconds
cpu usage
0.017152619
max memory
2191360.0
stage attributes
key
value
output-size
2090
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_hrs /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES ******** General Schema criterion ******** Found constructors: inl, inr Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>OK Checking (1) lam(%X.F[%X])@Y => F[Y] (meta F)[is acc in lam(%X.F[%X]),Y] [is positive in lam(%X.F[%X])] [is acc in F[%X]] (meta Y)[is acc in lam(%X.F[%X]),Y] [is positive in lam(%X.F[%X])] [is acc in Y] >>True Checking (2) lam(%Y.(U@%Y)) => U (meta U)[is acc in %Y.(U@%Y)] [is positive in U@%Y] [is acc in U] >>True Checking (3) piA(pair(V,W)) => V (meta V)[is acc in pair(V,W)] [is positive in pair(V,W)] [is acc in V] >>True Checking (4) piB(pair(P,X1)) => X1 (meta X1)[is acc in pair(P,X1)] [is positive in pair(P,X1)] [is acc in X1] >>True Checking (5) pair(piA(Y1),piB(Y1)) => Y1 (meta Y1)[is acc in piA(Y1),piB(Y1)] [is positive in piA(Y1)] [is acc in Y1] >>True Checking (6) case(inl(U1),%U.H1[%U],%Z.I1[%Z]) => H1[U1] (meta H1)[is acc in inl(U1),%U.H1[%U],%Z.I1[%Z]] [is positive in inl(U1)] [is acc in H1[%U]] (meta U1)[is acc in inl(U1),%U.H1[%U],%Z.I1[%Z]] [is positive in inl(U1)] [is acc in U1] >>True Checking (7) case(inr(P1),%W.F2[%W],%V.Z2[%V]) => Z2[P1] (meta Z2)[is acc in inr(P1),%W.F2[%W],%V.Z2[%V]] [is positive in inr(P1)] [is acc in Z2[%V]] (meta P1)[is acc in inr(P1),%W.F2[%W],%V.Z2[%V]] [is positive in inr(P1)] [is acc in P1] >>True #SN! ******** Signature ******** app : (arrAB,A) -> B case : (SAB,(A -> C),(B -> C)) -> C inl : A -> SAB inr : B -> SAB lam : (A -> B) -> arrAB pair : (A,B) -> PAB piA : PAB -> A piB : PAB -> B ******** Computation Rules ******** (1) lam(%X.F[%X])@Y => F[Y] (2) lam(%Y.(U@%Y)) => U (3) piA(pair(V,W)) => V (4) piB(pair(P,X1)) => X1 (5) pair(piA(Y1),piB(Y1)) => Y1 (6) case(inl(U1),%U.H1[%U],%Z.I1[%Z]) => H1[U1] (7) case(inr(P1),%W.F2[%W],%V.Z2[%V]) => Z2[P1] YES
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS 58631