Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516960959
details
property
value
status
complete
benchmark
thiemann23.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n077.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
ttt2-1.20
configuration
ttt2
runtime (wallclock)
13.8310520649 seconds
cpu usage
54.098789797
max memory
1.174028288E9
stage attributes
key
value
output-size
16827
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: digits() -> d(0()) d(x) -> if(le(x,s(s(s(s(s(s(s(s(s(0())))))))))),x) if(true(),x) -> cons(x,d(s(x))) if(false(),x) -> nil() le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) Proof: DP Processor: DPs: digits#() -> d#(0()) d#(x) -> le#(x,s(s(s(s(s(s(s(s(s(0())))))))))) d#(x) -> if#(le(x,s(s(s(s(s(s(s(s(s(0())))))))))),x) if#(true(),x) -> d#(s(x)) le#(s(x),s(y)) -> le#(x,y) TRS: digits() -> d(0()) d(x) -> if(le(x,s(s(s(s(s(s(s(s(s(0())))))))))),x) if(true(),x) -> cons(x,d(s(x))) if(false(),x) -> nil() le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) TDG Processor: DPs: digits#() -> d#(0()) d#(x) -> le#(x,s(s(s(s(s(s(s(s(s(0())))))))))) d#(x) -> if#(le(x,s(s(s(s(s(s(s(s(s(0())))))))))),x) if#(true(),x) -> d#(s(x)) le#(s(x),s(y)) -> le#(x,y) TRS: digits() -> d(0()) d(x) -> if(le(x,s(s(s(s(s(s(s(s(s(0())))))))))),x) if(true(),x) -> cons(x,d(s(x))) if(false(),x) -> nil() le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) graph: if#(true(),x) -> d#(s(x)) -> d#(x) -> if#(le(x,s(s(s(s(s(s(s(s(s(0())))))))))),x) if#(true(),x) -> d#(s(x)) -> d#(x) -> le#(x,s(s(s(s(s(s(s(s(s(0())))))))))) le#(s(x),s(y)) -> le#(x,y) -> le#(s(x),s(y)) -> le#(x,y) d#(x) -> if#(le(x,s(s(s(s(s(s(s(s(s(0())))))))))),x) -> if#(true(),x) -> d#(s(x)) d#(x) -> le#(x,s(s(s(s(s(s(s(s(s(0())))))))))) -> le#(s(x),s(y)) -> le#(x,y) digits#() -> d#(0()) -> d#(x) -> if#(le(x,s(s(s(s(s(s(s(s(s(0())))))))))),x) digits#() -> d#(0()) -> d#(x) -> le#(x,s(s(s(s(s(s(s(s(s(0())))))))))) SCC Processor: #sccs: 2 #rules: 3 #arcs: 7/25 DPs: if#(true(),x) -> d#(s(x)) d#(x) -> if#(le(x,s(s(s(s(s(s(s(s(s(0())))))))))),x) TRS: digits() -> d(0()) d(x) -> if(le(x,s(s(s(s(s(s(s(s(s(0())))))))))),x) if(true(),x) -> cons(x,d(s(x))) if(false(),x) -> nil() le(0(),y) -> true() le(s(x),0()) -> false() le(s(x),s(y)) -> le(x,y) Bounds Processor: bound: 21 enrichment: top-dp automaton: final states: {15,14} transitions: digits0() -> 13* s10(180) -> 181* s10(182) -> 183* s10(188) -> 189* s10(183) -> 184* s10(184) -> 185* s10(185) -> 186* s10(181) -> 182* s10(187) -> 188* s10(155) -> 191* s10(186) -> 187* if{#,4}(74,52) -> 14* true14() -> 250* 01() -> 18* true1() -> 28* false6() -> 118* d{#,9}(179) -> 14*
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard