Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711687
details
property
value
status
complete
benchmark
#4.26.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n057.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
1.1561870575 seconds
cpu usage
3.322145972
max memory
4.86608896E8
stage attributes
key
value
output-size
4484
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: p(0()) -> 0() p(s(x)) -> x le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(x,y) -> if(le(x,y),x,y) if(true(),x,y) -> 0() if(false(),x,y) -> s(minus(p(x),y)) Proof: DP Processor: DPs: le#(s(x),s(y)) -> le#(x,y) minus#(x,y) -> le#(x,y) minus#(x,y) -> if#(le(x,y),x,y) if#(false(),x,y) -> p#(x) if#(false(),x,y) -> minus#(p(x),y) TRS: p(0()) -> 0() p(s(x)) -> x le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(x,y) -> if(le(x,y),x,y) if(true(),x,y) -> 0() if(false(),x,y) -> s(minus(p(x),y)) TDG Processor: DPs: le#(s(x),s(y)) -> le#(x,y) minus#(x,y) -> le#(x,y) minus#(x,y) -> if#(le(x,y),x,y) if#(false(),x,y) -> p#(x) if#(false(),x,y) -> minus#(p(x),y) TRS: p(0()) -> 0() p(s(x)) -> x le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(x,y) -> if(le(x,y),x,y) if(true(),x,y) -> 0() if(false(),x,y) -> s(minus(p(x),y)) graph: if#(false(),x,y) -> minus#(p(x),y) -> minus#(x,y) -> if#(le(x,y),x,y) if#(false(),x,y) -> minus#(p(x),y) -> minus#(x,y) -> le#(x,y) minus#(x,y) -> if#(le(x,y),x,y) -> if#(false(),x,y) -> minus#(p(x),y) minus#(x,y) -> if#(le(x,y),x,y) -> if#(false(),x,y) -> p#(x) minus#(x,y) -> le#(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: 2 #rules: 3 #arcs: 6/25 DPs: if#(false(),x,y) -> minus#(p(x),y) minus#(x,y) -> if#(le(x,y),x,y) TRS: p(0()) -> 0() p(s(x)) -> x le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) minus(x,y) -> if(le(x,y),x,y) if(true(),x,y) -> 0() if(false(),x,y) -> s(minus(p(x),y)) Usable Rule Processor: DPs: if#(false(),x,y) -> minus#(p(x),y) minus#(x,y) -> if#(le(x,y),x,y) TRS: p(0()) -> 0() p(s(x)) -> x le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) Arctic Interpretation Processor: dimension: 1 usable rules: p(0()) -> 0() p(s(x)) -> x le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) interpretation: [if#](x0, x1, x2) = 2x0 + x1, [minus#](x0, x1) = 3x0 + 4, [false] = 2,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472