Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #487073492
details
property
value
status
complete
benchmark
jwcime2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n181.star.cs.uiowa.edu
space
Waldmann_06
run statistics
property
value
solver
ttt2-1.20
configuration
ttt2
runtime (wallclock)
1.01111 seconds
cpu usage
2.8901
user time
2.04671
system time
0.84339
max virtual memory
5830448.0
max residence set size
73148.0
stage attributes
key
value
starexec-result
YES
output
YES Problem: f(x,f(y,a())) -> f(f(f(f(a(),a()),y),h(a())),x) Proof: DP Processor: DPs: f#(x,f(y,a())) -> f#(a(),a()) f#(x,f(y,a())) -> f#(f(a(),a()),y) f#(x,f(y,a())) -> f#(f(f(a(),a()),y),h(a())) f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) TRS: f(x,f(y,a())) -> f(f(f(f(a(),a()),y),h(a())),x) EDG Processor: DPs: f#(x,f(y,a())) -> f#(a(),a()) f#(x,f(y,a())) -> f#(f(a(),a()),y) f#(x,f(y,a())) -> f#(f(f(a(),a()),y),h(a())) f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) TRS: f(x,f(y,a())) -> f(f(f(f(a(),a()),y),h(a())),x) graph: f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) -> f#(x,f(y,a())) -> f#(a(),a()) f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) -> f#(x,f(y,a())) -> f#(f(a(),a()),y) f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) -> f#(x,f(y,a())) -> f#(f(f(a(),a()),y),h(a())) f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) -> f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) f#(x,f(y,a())) -> f#(f(a(),a()),y) -> f#(x,f(y,a())) -> f#(a(),a()) f#(x,f(y,a())) -> f#(f(a(),a()),y) -> f#(x,f(y,a())) -> f#(f(a(),a()),y) f#(x,f(y,a())) -> f#(f(a(),a()),y) -> f#(x,f(y,a())) -> f#(f(f(a(),a()),y),h(a())) f#(x,f(y,a())) -> f#(f(a(),a()),y) -> f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) SCC Processor: #sccs: 1 #rules: 2 #arcs: 8/16 DPs: f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) f#(x,f(y,a())) -> f#(f(a(),a()),y) TRS: f(x,f(y,a())) -> f(f(f(f(a(),a()),y),h(a())),x) Bounds Processor: bound: 1 enrichment: match-dp automaton: final states: {8} transitions: f{#,0}(18,14) -> 8* f{#,0}(14,11) -> 8* f{#,0}(11,9) -> 8* a0() -> 10* f0(18,14) -> 13* f0(11,9) -> 13* f0(17,12) -> 18* f0(13,12) -> 14* f0(10,10) -> 11* f0(11,10) -> 17* f0(14,11) -> 13* a1() -> 15* f40() -> 9* h0(10) -> 12* f1(15,15) -> 16* f{#,1}(16,10) -> 8* problem: DPs: f#(x,f(y,a())) -> f#(f(f(f(a(),a()),y),h(a())),x) TRS: f(x,f(y,a())) -> f(f(f(f(a(),a()),y),h(a())),x) Bounds Processor: bound: 0 enrichment: match-dp automaton: final states: {1} transitions: f{#,0}(7,7) -> 1* f{#,0}(7,2) -> 1* a0() -> 3* f0(6,4) -> 7* f0(3,3) -> 5* f0(5,2) -> 6* f0(8,4) -> 9* f0(7,5) -> 6* f0(5,3) -> 8* f0(9,7) -> 6* h0(3) -> 4* f140() -> 2* problem: DPs: TRS: f(x,f(y,a())) -> f(f(f(f(a(),a()),y),h(a())),x) Qed
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard