Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487073537
details
property
value
status
complete
benchmark
jwttt.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n070.star.cs.uiowa.edu
space
Waldmann_06
run statistics
property
value
solver
ttt2-1.20
configuration
ttt2
runtime (wallclock)
1.85662 seconds
cpu usage
6.24371
user time
4.68913
system time
1.55457
max virtual memory
5843360.0
max residence set size
82636.0
stage attributes
key
value
starexec-result
YES
output
YES Problem: f(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y)) Proof: DP Processor: DPs: f#(x,f(a(),y)) -> f#(a(),x) f#(x,f(a(),y)) -> f#(a(),h(f(a(),x))) f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) TRS: f(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y)) EDG Processor: DPs: f#(x,f(a(),y)) -> f#(a(),x) f#(x,f(a(),y)) -> f#(a(),h(f(a(),x))) f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) TRS: f(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y)) graph: f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) -> f#(x,f(a(),y)) -> f#(a(),x) f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) -> f#(x,f(a(),y)) -> f#(a(),h(f(a(),x))) f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) -> f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) -> f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) -> f#(x,f(a(),y)) -> f#(a(),x) f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) -> f#(x,f(a(),y)) -> f#(a(),h(f(a(),x))) f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) -> f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) -> f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) f#(x,f(a(),y)) -> f#(a(),x) -> f#(x,f(a(),y)) -> f#(a(),x) f#(x,f(a(),y)) -> f#(a(),x) -> f#(x,f(a(),y)) -> f#(a(),h(f(a(),x))) f#(x,f(a(),y)) -> f#(a(),x) -> f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) f#(x,f(a(),y)) -> f#(a(),x) -> f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) SCC Processor: #sccs: 1 #rules: 3 #arcs: 12/16 DPs: f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) f#(x,f(a(),y)) -> f#(a(),x) TRS: f(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y)) Bounds Processor: bound: 1 enrichment: match-dp automaton: final states: {14} transitions: f{#,0}(16,15) -> 14* a0() -> 16* f0(16,16) -> 20* f0(16,21) -> 16* f0(16,15) -> 15* h1(39) -> 40* f1(41,21) -> 16* f1(34,40) -> 41* f1(34,34) -> 39* f40() -> 15* h0(20) -> 21* a1() -> 34* f{#,1}(41,21) -> 14* f{#,1}(34,34) -> 14* f{#,1}(34,16) -> 14* problem: DPs: f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) TRS: f(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y)) Subterm Criterion Processor: simple projection: pi(f) = [1,1] pi(f#) = [1,1] problem: DPs: f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) TRS: f(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y)) Semantic Labeling Processor: dimension: 2 usable rules: interpretation: [0 1] [1 0] [f](x0, x1) = [1 0]x0 + [0 0]x1, [0] [a] = [1],
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard