Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381709704
details
property
value
status
complete
benchmark
teparla2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n084.star.cs.uiowa.edu
space
Secret_05_TRS
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
8.25475597382 seconds
cpu usage
31.429623857
max memory
7.5554816E8
stage attributes
key
value
output-size
33127
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: f(y,f(x,f(a(),x))) -> f(f(f(a(),x),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#(f(a(),x),f(x,a())) f#(y,f(x,f(a(),x))) -> f#(f(f(a(),x),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(f(a(),x),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#(f(a(),x),f(x,a())) f#(y,f(x,f(a(),x))) -> f#(f(f(a(),x),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(f(a(),x),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(f(a(),x),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(f(a(),x),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(f(a(),x),f(x,a())),f(a(),y)) -> f#(y,f(x,f(a(),x))) -> f#(f(a(),x),f(x,a())) f#(y,f(x,f(a(),x))) -> f#(f(f(a(),x),f(x,a())),f(a(),y)) -> f#(y,f(x,f(a(),x))) -> f#(f(f(a(),x),f(x,a())),f(a(),y)) f#(y,f(x,f(a(),x))) -> f#(f(f(a(),x),f(x,a())),f(a(),y)) -> f#(x,f(x,y)) -> f#(x,a()) f#(y,f(x,f(a(),x))) -> f#(f(f(a(),x),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(f(a(),x),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#(f(a(),x),f(x,a())) -> f#(x,f(x,y)) -> f#(x,a()) f#(y,f(x,f(a(),x))) -> f#(f(a(),x),f(x,a())) -> f#(x,f(x,y)) -> f#(f(x,a()),a()) f#(y,f(x,f(a(),x))) -> f#(f(a(),x),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#(f(a(),x),f(x,a())) f#(y,f(x,f(a(),x))) -> f#(a(),y) -> f#(y,f(x,f(a(),x))) -> f#(f(f(a(),x),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(f(a(),x),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(f(a(),x),f(x,a())),f(a(),y)) f(x,f(x,y)) -> f(f(f(x,a()),a()),a()) Bounds Processor: bound: 2 enrichment: match-dp automaton: final states: {23,5} transitions: f{#,0}(43,1) -> 15* f{#,0}(51,43) -> 23*,5 f{#,0}(32,20) -> 15* f{#,0}(22,18) -> 15* f{#,0}(42,22) -> 15* f{#,0}(46,43) -> 23*,5 f{#,0}(43,3) -> 15* f{#,0}(51,45) -> 23*,5 f{#,0}(22,20) -> 23*,5 f{#,0}(32,22) -> 15* f{#,0}(2,16) -> 15* f{#,0}(46,45) -> 23*,5 f{#,0}(23,1) -> 15* f{#,0}(18,1) -> 15*
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472