Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710049
details
property
value
status
complete
benchmark
jw34.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n096.star.cs.uiowa.edu
space
Zantema_05
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
1.13666892052 seconds
cpu usage
2.97705534
max memory
2.72945152E8
stage attributes
key
value
output-size
2943
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(f(a(),a()),x) -> f(f(x,f(a(),f(a(),a()))),a()) Proof: Extended Uncurrying Processor: application symbol: f symbol table: a ==> a0/0 a1/1 a2/2 uncurry-rules: f(a1(x1),x2) -> a2(x1,x2) f(a0(),x1) -> a1(x1) eta-rules: problem: a2(a0(),x) -> f(f(x,a1(a1(a0()))),a0()) f(a1(x1),x2) -> a2(x1,x2) f(a0(),x1) -> a1(x1) DP Processor: DPs: a{2,#}(a0(),x) -> f#(x,a1(a1(a0()))) a{2,#}(a0(),x) -> f#(f(x,a1(a1(a0()))),a0()) f#(a1(x1),x2) -> a{2,#}(x1,x2) TRS: a2(a0(),x) -> f(f(x,a1(a1(a0()))),a0()) f(a1(x1),x2) -> a2(x1,x2) f(a0(),x1) -> a1(x1) TDG Processor: DPs: a{2,#}(a0(),x) -> f#(x,a1(a1(a0()))) a{2,#}(a0(),x) -> f#(f(x,a1(a1(a0()))),a0()) f#(a1(x1),x2) -> a{2,#}(x1,x2) TRS: a2(a0(),x) -> f(f(x,a1(a1(a0()))),a0()) f(a1(x1),x2) -> a2(x1,x2) f(a0(),x1) -> a1(x1) graph: f#(a1(x1),x2) -> a{2,#}(x1,x2) -> a{2,#}(a0(),x) -> f#(f(x,a1(a1(a0()))),a0()) f#(a1(x1),x2) -> a{2,#}(x1,x2) -> a{2,#}(a0(),x) -> f#(x,a1(a1(a0()))) a{2,#}(a0(),x) -> f#(f(x,a1(a1(a0()))),a0()) -> f#(a1(x1),x2) -> a{2,#}(x1,x2) a{2,#}(a0(),x) -> f#(x,a1(a1(a0()))) -> f#(a1(x1),x2) -> a{2,#}(x1,x2) Bounds Processor: bound: 0 enrichment: match-dp automaton: final states: {1} transitions: f70() -> 5* f{#,0}(19,2) -> 1* f{#,0}(4,4) -> 1* f{#,0}(5,4) -> 1* a{1,0}(2) -> 3* a{1,0}(3) -> 4* a{0,0}() -> 2* f0(4,4) -> 19* a{2,#,0}(3,4) -> 1* a{2,#,0}(5,4) -> 1* a{2,0}(3,4) -> 19* problem: DPs: a{2,#}(a0(),x) -> f#(f(x,a1(a1(a0()))),a0()) f#(a1(x1),x2) -> a{2,#}(x1,x2) TRS: a2(a0(),x) -> f(f(x,a1(a1(a0()))),a0()) f(a1(x1),x2) -> a2(x1,x2) f(a0(),x1) -> a1(x1) Bounds Processor: bound: 1 enrichment: match automaton: final states: {10,9,8,7,1} transitions: a{2,0}(4,2) -> 8,9 a{2,0}(5,5) -> 9* a{2,0}(3,4) -> 12* a{2,0}(5,4) -> 6* a{2,#,1}(4,2) -> 1,7 f160() -> 5* a{2,1}(4,2) -> 8* a{2,1}(3,4) -> 12* f{#,0}(6,2) -> 1* a{1,0}(5) -> 10* a{1,0}(2) -> 3* a{1,0}(4) -> 6* a{1,0}(3) -> 4* a{0,0}() -> 2* f0(4,4) -> 12* f0(6,2) -> 8* f0(5,4) -> 6*
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472