Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Standard pair #516961029
details
property
value
status
complete
benchmark
teparla3.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n055.star.cs.uiowa.edu
space
Secret_05_TRS
run statistics
property
value
solver
ttt2-1.20
configuration
ttt2
runtime (wallclock)
1.9299800396 seconds
cpu usage
6.210935115
max memory
1.015349248E9
stage attributes
key
value
output-size
8136
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: f(y,f(x,f(a(),x))) -> f(f(a(),f(x,a())),f(a(),y)) f(x,f(x,y)) -> f(f(f(x,a()),a()),a()) Proof: DP Processor: DPs: f#(y,f(x,f(a(),x))) -> f#(a(),y) f#(y,f(x,f(a(),x))) -> f#(x,a()) f#(y,f(x,f(a(),x))) -> f#(a(),f(x,a())) f#(y,f(x,f(a(),x))) -> f#(f(a(),f(x,a())),f(a(),y)) f#(x,f(x,y)) -> f#(x,a()) f#(x,f(x,y)) -> f#(f(x,a()),a()) f#(x,f(x,y)) -> f#(f(f(x,a()),a()),a()) TRS: f(y,f(x,f(a(),x))) -> f(f(a(),f(x,a())),f(a(),y)) f(x,f(x,y)) -> f(f(f(x,a()),a()),a()) EDG Processor: DPs: f#(y,f(x,f(a(),x))) -> f#(a(),y) f#(y,f(x,f(a(),x))) -> f#(x,a()) f#(y,f(x,f(a(),x))) -> f#(a(),f(x,a())) f#(y,f(x,f(a(),x))) -> f#(f(a(),f(x,a())),f(a(),y)) f#(x,f(x,y)) -> f#(x,a()) f#(x,f(x,y)) -> f#(f(x,a()),a()) f#(x,f(x,y)) -> f#(f(f(x,a()),a()),a()) TRS: f(y,f(x,f(a(),x))) -> f(f(a(),f(x,a())),f(a(),y)) f(x,f(x,y)) -> f(f(f(x,a()),a()),a()) graph: f#(y,f(x,f(a(),x))) -> f#(f(a(),f(x,a())),f(a(),y)) -> f#(y,f(x,f(a(),x))) -> f#(a(),y) f#(y,f(x,f(a(),x))) -> f#(f(a(),f(x,a())),f(a(),y)) -> f#(y,f(x,f(a(),x))) -> f#(x,a()) f#(y,f(x,f(a(),x))) -> f#(f(a(),f(x,a())),f(a(),y)) -> f#(y,f(x,f(a(),x))) -> f#(a(),f(x,a())) f#(y,f(x,f(a(),x))) -> f#(f(a(),f(x,a())),f(a(),y)) -> f#(y,f(x,f(a(),x))) -> f#(f(a(),f(x,a())),f(a(),y)) f#(y,f(x,f(a(),x))) -> f#(f(a(),f(x,a())),f(a(),y)) -> f#(x,f(x,y)) -> f#(x,a()) f#(y,f(x,f(a(),x))) -> f#(f(a(),f(x,a())),f(a(),y)) -> f#(x,f(x,y)) -> f#(f(x,a()),a()) f#(y,f(x,f(a(),x))) -> f#(f(a(),f(x,a())),f(a(),y)) -> f#(x,f(x,y)) -> f#(f(f(x,a()),a()),a()) f#(y,f(x,f(a(),x))) -> f#(a(),f(x,a())) -> f#(x,f(x,y)) -> f#(x,a()) f#(y,f(x,f(a(),x))) -> f#(a(),f(x,a())) -> f#(x,f(x,y)) -> f#(f(x,a()),a()) f#(y,f(x,f(a(),x))) -> f#(a(),f(x,a())) -> f#(x,f(x,y)) -> f#(f(f(x,a()),a()),a()) f#(y,f(x,f(a(),x))) -> f#(a(),y) -> f#(y,f(x,f(a(),x))) -> f#(a(),y) f#(y,f(x,f(a(),x))) -> f#(a(),y) -> f#(y,f(x,f(a(),x))) -> f#(x,a()) f#(y,f(x,f(a(),x))) -> f#(a(),y) -> f#(y,f(x,f(a(),x))) -> f#(a(),f(x,a())) f#(y,f(x,f(a(),x))) -> f#(a(),y) -> f#(y,f(x,f(a(),x))) -> f#(f(a(),f(x,a())),f(a(),y)) f#(y,f(x,f(a(),x))) -> f#(a(),y) -> f#(x,f(x,y)) -> f#(x,a()) f#(y,f(x,f(a(),x))) -> f#(a(),y) -> f#(x,f(x,y)) -> f#(f(x,a()),a()) f#(y,f(x,f(a(),x))) -> f#(a(),y) -> f#(x,f(x,y)) -> f#(f(f(x,a()),a()),a()) SCC Processor: #sccs: 1 #rules: 2 #arcs: 17/49 DPs: f#(y,f(x,f(a(),x))) -> f#(f(a(),f(x,a())),f(a(),y)) f#(y,f(x,f(a(),x))) -> f#(a(),y) TRS: f(y,f(x,f(a(),x))) -> f(f(a(),f(x,a())),f(a(),y)) f(x,f(x,y)) -> f(f(f(x,a()),a()),a()) Bounds Processor: bound: 1 enrichment: match-dp automaton: final states: {1} transitions: f0(19,10) -> 4* f0(3,5) -> 6* f0(3,24) -> 4* f0(21,3) -> 23*,2 f0(4,10) -> 4* f0(23,3) -> 26* f0(3,23) -> 6,20*,4 f0(26,10) -> 4* f0(24,10) -> 4* f0(6,10) -> 4* f0(24,3) -> 2,27* f0(19,3) -> 21* f0(3,25) -> 6,4,20* f0(3,6) -> 4*
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Standard