Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516967654
details
property
value
status
complete
benchmark
#4.27.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n116.star.cs.uiowa.edu
space
Strategy_removed_AG01
run statistics
property
value
solver
ttt2-1.20
configuration
ttt2
runtime (wallclock)
1.03826093674 seconds
cpu usage
2.409905064
max memory
4.38984704E8
stage attributes
key
value
output-size
3790
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/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,0()) -> x minus(x,s(y)) -> if(le(x,s(y)),0(),p(minus(x,p(s(y))))) if(true(),x,y) -> x if(false(),x,y) -> y Proof: DP Processor: DPs: le#(s(x),s(y)) -> le#(x,y) minus#(x,s(y)) -> p#(s(y)) minus#(x,s(y)) -> minus#(x,p(s(y))) minus#(x,s(y)) -> p#(minus(x,p(s(y)))) minus#(x,s(y)) -> le#(x,s(y)) minus#(x,s(y)) -> if#(le(x,s(y)),0(),p(minus(x,p(s(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,0()) -> x minus(x,s(y)) -> if(le(x,s(y)),0(),p(minus(x,p(s(y))))) if(true(),x,y) -> x if(false(),x,y) -> y TDG Processor: DPs: le#(s(x),s(y)) -> le#(x,y) minus#(x,s(y)) -> p#(s(y)) minus#(x,s(y)) -> minus#(x,p(s(y))) minus#(x,s(y)) -> p#(minus(x,p(s(y)))) minus#(x,s(y)) -> le#(x,s(y)) minus#(x,s(y)) -> if#(le(x,s(y)),0(),p(minus(x,p(s(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,0()) -> x minus(x,s(y)) -> if(le(x,s(y)),0(),p(minus(x,p(s(y))))) if(true(),x,y) -> x if(false(),x,y) -> y graph: minus#(x,s(y)) -> minus#(x,p(s(y))) -> minus#(x,s(y)) -> if#(le(x,s(y)),0(),p(minus(x,p(s(y))))) minus#(x,s(y)) -> minus#(x,p(s(y))) -> minus#(x,s(y)) -> le#(x,s(y)) minus#(x,s(y)) -> minus#(x,p(s(y))) -> minus#(x,s(y)) -> p#(minus(x,p(s(y)))) minus#(x,s(y)) -> minus#(x,p(s(y))) -> minus#(x,s(y)) -> minus#(x,p(s(y))) minus#(x,s(y)) -> minus#(x,p(s(y))) -> minus#(x,s(y)) -> p#(s(y)) minus#(x,s(y)) -> le#(x,s(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: 2 #arcs: 7/36 DPs: minus#(x,s(y)) -> minus#(x,p(s(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,0()) -> x minus(x,s(y)) -> if(le(x,s(y)),0(),p(minus(x,p(s(y))))) if(true(),x,y) -> x if(false(),x,y) -> y Usable Rule Processor: DPs: minus#(x,s(y)) -> minus#(x,p(s(y))) TRS: p(s(x)) -> x Semantic Labeling Processor: dimension: 2 usable rules: interpretation: [1 0] [1] [p](x0) = [1 0]x0 + [0], [1 1] [0] [s](x0) = [1 1]x0 + [1] labeled:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard