Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381713803
details
property
value
status
complete
benchmark
#3.5b.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n013.star.cs.uiowa.edu
space
AG01
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
1.51224994659 seconds
cpu usage
4.237914756
max memory
5.28633856E8
stage attributes
key
value
output-size
7652
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(0(),y) -> 0() minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) if_minus(true(),s(x),y) -> 0() if_minus(false(),s(x),y) -> s(minus(x,y)) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y)) if_mod(false(),s(x),s(y)) -> s(x) Proof: DP Processor: DPs: le#(s(x),s(y)) -> le#(x,y) minus#(s(x),y) -> le#(s(x),y) minus#(s(x),y) -> if_minus#(le(s(x),y),s(x),y) if_minus#(false(),s(x),y) -> minus#(x,y) mod#(s(x),s(y)) -> le#(y,x) mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) if_mod#(true(),s(x),s(y)) -> minus#(x,y) if_mod#(true(),s(x),s(y)) -> mod#(minus(x,y),s(y)) TRS: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(0(),y) -> 0() minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) if_minus(true(),s(x),y) -> 0() if_minus(false(),s(x),y) -> s(minus(x,y)) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y)) if_mod(false(),s(x),s(y)) -> s(x) TDG Processor: DPs: le#(s(x),s(y)) -> le#(x,y) minus#(s(x),y) -> le#(s(x),y) minus#(s(x),y) -> if_minus#(le(s(x),y),s(x),y) if_minus#(false(),s(x),y) -> minus#(x,y) mod#(s(x),s(y)) -> le#(y,x) mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) if_mod#(true(),s(x),s(y)) -> minus#(x,y) if_mod#(true(),s(x),s(y)) -> mod#(minus(x,y),s(y)) TRS: le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(0(),y) -> 0() minus(s(x),y) -> if_minus(le(s(x),y),s(x),y) if_minus(true(),s(x),y) -> 0() if_minus(false(),s(x),y) -> s(minus(x,y)) mod(0(),y) -> 0() mod(s(x),0()) -> 0() mod(s(x),s(y)) -> if_mod(le(y,x),s(x),s(y)) if_mod(true(),s(x),s(y)) -> mod(minus(x,y),s(y)) if_mod(false(),s(x),s(y)) -> s(x) graph: if_mod#(true(),s(x),s(y)) -> mod#(minus(x,y),s(y)) -> mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) if_mod#(true(),s(x),s(y)) -> mod#(minus(x,y),s(y)) -> mod#(s(x),s(y)) -> le#(y,x) if_mod#(true(),s(x),s(y)) -> minus#(x,y) -> minus#(s(x),y) -> if_minus#(le(s(x),y),s(x),y) if_mod#(true(),s(x),s(y)) -> minus#(x,y) -> minus#(s(x),y) -> le#(s(x),y) mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) -> if_mod#(true(),s(x),s(y)) -> mod#(minus(x,y),s(y)) mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) -> if_mod#(true(),s(x),s(y)) -> minus#(x,y) mod#(s(x),s(y)) -> le#(y,x) -> le#(s(x),s(y)) -> le#(x,y) if_minus#(false(),s(x),y) -> minus#(x,y) -> minus#(s(x),y) -> if_minus#(le(s(x),y),s(x),y) if_minus#(false(),s(x),y) -> minus#(x,y) -> minus#(s(x),y) -> le#(s(x),y) minus#(s(x),y) -> if_minus#(le(s(x),y),s(x),y) -> if_minus#(false(),s(x),y) -> minus#(x,y) minus#(s(x),y) -> le#(s(x),y) -> le#(s(x),s(y)) -> le#(x,y) le#(s(x),s(y)) -> le#(x,y) -> le#(s(x),s(y)) -> le#(x,y) SCC Processor: #sccs: 3 #rules: 5 #arcs: 12/64 DPs: if_mod#(true(),s(x),s(y)) -> mod#(minus(x,y),s(y)) mod#(s(x),s(y)) -> if_mod#(le(y,x),s(x),s(y)) TRS:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472