Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS 58631 pair #381918971
details
property
value
status
complete
benchmark
h09.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n030.star.cs.uiowa.edu
space
Hamana_Kikuchi_18
run statistics
property
value
solver
sol 37957
configuration
hrs
runtime (wallclock)
0.042277097702 seconds
cpu usage
0.039457915
max memory
5279744.0
stage attributes
key
value
output-size
2407
starexec-result
MAYBE
output
/export/starexec/sandbox/solver/bin/starexec_run_hrs /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE We split firstr-order part and higher-order part, and do modular checking by a general modularity. ******** FO SN check ******** Check SN using NaTT (Nagoya Termination Tool) Input TRS: 1: g(U) -> true() 2: _(X1,X2) -> X1 3: _(X1,X2) -> X2 Number of strict rules: 3 Direct POLO(bPol) ... removes: 1 3 2 _ w: 2 * x1 + 2 * x2 + 1 true w: 0 g w: x1 + 1 Number of strict rules: 0 ... Input TRS: 1: g(U) -> true() 2: _(X1,X2) -> X1 3: _(X1,X2) -> X2 Number of strict rules: 3 Direct POLO(bPol) ... removes: 1 3 2 _ w: 2 * x1 + 2 * x2 + 1 true w: 0 g w: x1 + 1 Number of strict rules: 0 >>YES ******** Signature ******** rec : (((N,(N -> B),N) -> B),B,N) -> B 0 : N h : (N,(N -> B),N) -> B false : B iszero : (N,N) -> B g : N -> B ******** Computation rules ******** (1) rec(F,Z[0]) => Z (3) h(V,I,P) => false (4) iszero(X1,Y1) => rec(h,g(X1),Y1) ******** General Schema criterion ******** Found constructors: 0, false, true Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>OK Checking (1) rec(F,Z[0]) => Z (meta Z)[is acc in F,Z[0]] [is acc in Z[0]] >>False Try again using status RL Checking (1) rec(F,Z[0]) => Z (meta Z)[is acc in F,Z[0]] [is acc in Z[0]] >>False Try again using status Mul Checking (1) rec(F,Z[0]) => Z (meta Z)[is acc in F,Z[0]] [is acc in Z[0]] >>False Found constructors: 0, false, g Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>OK Checking (1) rec(F,Z[0]) => Z (meta Z)[is acc in F,Z[0]] [is acc in Z[0]] >>False Try again using status RL Checking (1) rec(F,Z[0]) => Z (meta Z)[is acc in F,Z[0]] [is acc in Z[0]] >>False Try again using status Mul Checking (1) rec(F,Z[0]) => Z (meta Z)[is acc in F,Z[0]] [is acc in Z[0]] >>False #No idea.. ******** Signature ******** 0 : N false : B g : N -> B h : (N,(N -> B),N) -> B iszero : (N,N) -> B rec : (((N,(N -> B),N) -> B),B,N) -> B true : B ******** Computation Rules ******** (1) rec(F,Z[0]) => Z (2) g(U) => true (3) h(V,I,P) => false (4) iszero(X1,Y1) => rec(h,g(X1),Y1) MAYBE
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS 58631