Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
HRS 58631 pair #381919032
details
property
value
status
complete
benchmark
AotoYamada_05__Ex5TermProof.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n040.star.cs.uiowa.edu
space
Uncurried_Applicative_11
run statistics
property
value
solver
sol 37957
configuration
hrs
runtime (wallclock)
0.0259981155396 seconds
cpu usage
0.016421697
max memory
2056192.0
stage attributes
key
value
output-size
2121
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_hrs /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES ******** General Schema criterion ******** Found constructors: 0, s Checking type order >>OK Checking positivity of constructors >>OK Checking function dependency >>OK Checking (1) add(0,X) => X (meta X)[is acc in 0,X] [is positive in 0] [is acc in X] >>True Checking (2) add(s(Y),U) => s(add(Y,U)) (fun add>s) (fun add=add) subterm comparison of args w. LR LR (meta Y)[is acc in s(Y),U] [is positive in s(Y)] [is acc in Y] (meta U)[is acc in s(Y),U] [is positive in s(Y)] [is acc in U] >>True Checking (3) mult(0,V) => 0 (fun mult>0) >>True Checking (4) mult(s(W),P) => add(mult(W,P),P) (fun mult>add) (fun mult=mult) subterm comparison of args w. LR LR (meta W)[is acc in s(W),P] [is positive in s(W)] [is acc in W] (meta P)[is acc in s(W),P] [is positive in s(W)] [is acc in P] (meta P)[is acc in s(W),P] [is positive in s(W)] [is acc in P] >>True Checking (5) rec(F1,Y1,0) => Y1 (meta Y1)[is acc in F1,Y1,0] [is acc in Y1] >>True Checking (6) rec(G1,V1,s(W1)) => G1[s(W1),rec(G1,V1,W1)] (meta G1)[is acc in G1,V1,s(W1)] [is acc in G1] (fun rec>s) (meta W1)[is acc in G1,V1,s(W1)] [is positive in s(W1)] [is acc in W1] (fun rec=rec) subterm comparison of args w. LR LR (meta G1)[is acc in G1,V1,s(W1)] [is acc in G1] (meta V1)[is acc in G1,V1,s(W1)] [is acc in V1] (meta W1)[is acc in G1,V1,s(W1)] [is positive in s(W1)] [is acc in W1] >>True Checking (7) fact => rec(mult,s(0)) (fun fact>rec) (fun fact>mult) (fun fact>s) (fun fact>0) >>True #SN! ******** Signature ******** 0 : a add : (a,a) -> a fact : a -> a mult : (a,a) -> a rec : (((a,a) -> a),a,a) -> a s : a -> a ******** Computation Rules ******** (1) add(0,X) => X (2) add(s(Y),U) => s(add(Y,U)) (3) mult(0,V) => 0 (4) mult(s(W),P) => add(mult(W,P),P) (5) rec(F1,Y1,0) => Y1 (6) rec(G1,V1,s(W1)) => G1[s(W1),rec(G1,V1,W1)] (7) fact => rec(mult,s(0)) YES
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to HRS 58631