Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516967558
details
property
value
status
complete
benchmark
modulo.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n063.star.cs.uiowa.edu
space
AProVE_06
run statistics
property
value
solver
NaTT 2.1
configuration
default
runtime (wallclock)
0.507524967194 seconds
cpu usage
0.503891012
max memory
2.6906624E7
stage attributes
key
value
output-size
2162
starexec-result
MAYBE
output
/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: le(0(),y) -> true() 2: le(s(x),0()) -> false() 3: le(s(x),s(y)) -> le(x,y) 4: minus(x,x) -> 0() 5: minus(x,0()) -> x 6: minus(0(),x) -> 0() 7: minus(s(x),s(y)) -> minus(x,y) 8: isZero(0()) -> true() 9: isZero(s(x)) -> false() 10: mod(x,y) -> if_mod(isZero(y),le(y,x),x,y,minus(x,y)) 11: if_mod(true(),b,x,y,z) -> divByZeroError() 12: if_mod(false(),false(),x,y,z) -> x 13: if_mod(false(),true(),x,y,z) -> mod(z,y) Number of strict rules: 13 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #if_mod(false(),true(),x,y,z) -> #mod(z,y) #2: #minus(s(x),s(y)) -> #minus(x,y) #3: #mod(x,y) -> #if_mod(isZero(y),le(y,x),x,y,minus(x,y)) #4: #mod(x,y) -> #isZero(y) #5: #mod(x,y) -> #le(y,x) #6: #mod(x,y) -> #minus(x,y) #7: #le(s(x),s(y)) -> #le(x,y) Number of SCCs: 3, DPs: 4 SCC { #7 } Sum... succeeded. le(x1,x2) w: (0) s(x1) w: (1 + x1) #le(x1,x2) w: (x2 + x1) #isZero(x1) w: (0) divByZeroError() w: (0) minus(x1,x2) w: (0) mod(x1,x2) w: (0) false() w: (0) true() w: (0) if_mod(x1,x2,x3,x4,x5) w: (0) 0() w: (0) #minus(x1,x2) w: (0) #mod(x1,x2) w: (0) #if_mod(x1,x2,x3,x4,x5) w: (0) isZero(x1) w: (0) USABLE RULES: { } Removed DPs: #7 Number of SCCs: 2, DPs: 3 SCC { #2 } Sum... succeeded. le(x1,x2) w: (0) s(x1) w: (1 + x1) #le(x1,x2) w: (0) #isZero(x1) w: (0) divByZeroError() w: (0) minus(x1,x2) w: (0) mod(x1,x2) w: (0) false() w: (0) true() w: (0) if_mod(x1,x2,x3,x4,x5) w: (0) 0() w: (0) #minus(x1,x2) w: (x2) #mod(x1,x2) w: (0) #if_mod(x1,x2,x3,x4,x5) w: (0) isZero(x1) w: (0) USABLE RULES: { } Removed DPs: #2 Number of SCCs: 1, DPs: 2 SCC { #1 #3 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed. Finding a loop... failed.
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard