Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381711046
details
property
value
status
complete
benchmark
hydra.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n101.star.cs.uiowa.edu
space
Mixed_TRS
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
0.947243928909 seconds
cpu usage
2.461413583
max memory
3.49343744E8
stage attributes
key
value
output-size
3159
starexec-result
YES
output
/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: f(cons(nil(),y)) -> y f(cons(f(cons(nil(),y)),z)) -> copy(n(),y,z) copy(0(),y,z) -> f(z) copy(s(x),y,z) -> copy(x,y,cons(f(y),z)) Proof: DP Processor: DPs: f#(cons(f(cons(nil(),y)),z)) -> copy#(n(),y,z) copy#(0(),y,z) -> f#(z) copy#(s(x),y,z) -> f#(y) copy#(s(x),y,z) -> copy#(x,y,cons(f(y),z)) TRS: f(cons(nil(),y)) -> y f(cons(f(cons(nil(),y)),z)) -> copy(n(),y,z) copy(0(),y,z) -> f(z) copy(s(x),y,z) -> copy(x,y,cons(f(y),z)) TDG Processor: DPs: f#(cons(f(cons(nil(),y)),z)) -> copy#(n(),y,z) copy#(0(),y,z) -> f#(z) copy#(s(x),y,z) -> f#(y) copy#(s(x),y,z) -> copy#(x,y,cons(f(y),z)) TRS: f(cons(nil(),y)) -> y f(cons(f(cons(nil(),y)),z)) -> copy(n(),y,z) copy(0(),y,z) -> f(z) copy(s(x),y,z) -> copy(x,y,cons(f(y),z)) graph: copy#(s(x),y,z) -> copy#(x,y,cons(f(y),z)) -> copy#(s(x),y,z) -> copy#(x,y,cons(f(y),z)) copy#(s(x),y,z) -> copy#(x,y,cons(f(y),z)) -> copy#(s(x),y,z) -> f#(y) copy#(s(x),y,z) -> copy#(x,y,cons(f(y),z)) -> copy#(0(),y,z) -> f#(z) copy#(s(x),y,z) -> f#(y) -> f#(cons(f(cons(nil(),y)),z)) -> copy#(n(),y,z) copy#(0(),y,z) -> f#(z) -> f#(cons(f(cons(nil(),y)),z)) -> copy#(n(),y,z) f#(cons(f(cons(nil(),y)),z)) -> copy#(n(),y,z) -> copy#(s(x),y,z) -> copy#(x,y,cons(f(y),z)) f#(cons(f(cons(nil(),y)),z)) -> copy#(n(),y,z) -> copy#(s(x),y,z) -> f#(y) f#(cons(f(cons(nil(),y)),z)) -> copy#(n(),y,z) -> copy#(0(),y,z) -> f#(z) EDG Processor: DPs: f#(cons(f(cons(nil(),y)),z)) -> copy#(n(),y,z) copy#(0(),y,z) -> f#(z) copy#(s(x),y,z) -> f#(y) copy#(s(x),y,z) -> copy#(x,y,cons(f(y),z)) TRS: f(cons(nil(),y)) -> y f(cons(f(cons(nil(),y)),z)) -> copy(n(),y,z) copy(0(),y,z) -> f(z) copy(s(x),y,z) -> copy(x,y,cons(f(y),z)) graph: copy#(s(x),y,z) -> copy#(x,y,cons(f(y),z)) -> copy#(0(),y,z) -> f#(z) copy#(s(x),y,z) -> copy#(x,y,cons(f(y),z)) -> copy#(s(x),y,z) -> f#(y) copy#(s(x),y,z) -> copy#(x,y,cons(f(y),z)) -> copy#(s(x),y,z) -> copy#(x,y,cons(f(y),z)) copy#(s(x),y,z) -> f#(y) -> f#(cons(f(cons(nil(),y)),z)) -> copy#(n(),y,z) copy#(0(),y,z) -> f#(z) -> f#(cons(f(cons(nil(),y)),z)) -> copy#(n(),y,z) SCC Processor: #sccs: 1 #rules: 1 #arcs: 5/16 DPs: copy#(s(x),y,z) -> copy#(x,y,cons(f(y),z)) TRS: f(cons(nil(),y)) -> y f(cons(f(cons(nil(),y)),z)) -> copy(n(),y,z) copy(0(),y,z) -> f(z) copy(s(x),y,z) -> copy(x,y,cons(f(y),z)) Size-Change Termination Processor: DPs: TRS: f(cons(nil(),y)) -> y f(cons(f(cons(nil(),y)),z)) -> copy(n(),y,z) copy(0(),y,z) -> f(z) copy(s(x),y,z) -> copy(x,y,cons(f(y),z)) The DP: copy#(s(x),y,z) -> copy#(x,y,cons(f(y),z)) has the edges: 0 > 0 1 >= 1 Qed
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472