Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS 58631 pair #381919134
details
property
value
status
complete
benchmark
Applicative_first_order_05__#3.32.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n053.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
sol 37957
configuration
hrs
runtime (wallclock)
0.0505611896515 seconds
cpu usage
0.050771596
max memory
1.050624E7
stage attributes
key
value
output-size
5235
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 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: f(a()) -> f(b()) 2: g(b()) -> g(a()) 3: _(X1,X2) -> X1 4: _(X1,X2) -> X2 Number of strict rules: 4 Direct POLO(bPol) ... removes: 4 3 a w: 2 b w: 2 _ w: 2 * x1 + x2 + 1 f w: x1 + 8855 g w: x1 + 449 Number of strict rules: 2 Direct POLO(bPol) ... failed. Uncurrying f g 1: f^1_a() -> f^1_b() 2: g^1_b() -> g^1_a() 5: g(a()) ->= g^1_a() 6: g(b()) ->= g^1_b() 7: f(a()) ->= f^1_a() 8: f(b()) ->= f^1_b() Number of strict rules: 2 Direct POLO(bPol) ... removes: 8 1 5 7 6 2 a w: 7720 g^1_b w: 1 b w: 1 g^1_a w: 0 f^1_b w: 0 _ w: x1 + x2 f w: 2 * x1 + 1 f^1_a w: 1 g w: 2 * x1 + 2437 Number of strict rules: 0 ... Input TRS: 1: f(a()) -> f(b()) 2: g(b()) -> g(a()) 3: _(X1,X2) -> X1 4: _(X1,X2) -> X2 Number of strict rules: 4 Direct POLO(bPol) ... removes: 4 3 a w: 2 b w: 2 _ w: 2 * x1 + x2 + 1 f w: x1 + 8855 g w: x1 + 449 Number of strict rules: 2 Direct POLO(bPol) ... failed. Uncurrying f g 1: f^1_a() -> f^1_b() 2: g^1_b() -> g^1_a() 5: g(a()) ->= g^1_a() 6: g(b()) ->= g^1_b() 7: f(a()) ->= f^1_a() 8: f(b()) ->= f^1_b() Number of strict rules: 2 Direct POLO(bPol) ... removes: 8 1 5 7 6 2 a w: 7720 g^1_b w: 1 b w: 1 g^1_a w: 0 f^1_b w: 0 _ w: x1 + x2 f w: 2 * x1 + 1 f^1_a w: 1 g w: 2 * x1 + 2437 Number of strict rules: 0 >>YES ******** Signature ******** map : ((e -> e),f) -> f nil : f cons : (e,f) -> f filter : ((e -> d),f) -> f filter2 : (d,(e -> d),e,f) -> f true : d false : d ******** Computation rules ******** (3) map(F,nil) => nil (4) map(Z,cons(U,V)) => cons(Z[U],map(Z,V)) (5) filter(I,nil) => nil (6) filter(J,cons(X1,Y1)) => filter2(J[X1],J,X1,Y1) (7) filter2(true,G1,V1,W1) => cons(V1,filter(G1,W1)) (8) filter2(false,J1,X2,Y2) => filter(J1,Y2) ******** General Schema criterion ********
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS 58631