Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381712251
details
property
value
status
complete
benchmark
jwttt.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n075.star.cs.uiowa.edu
space
Waldmann_06
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
1.94126200676 seconds
cpu usage
6.374934321
max memory
5.49187584E8
stage attributes
key
value
output-size
3802
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(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y)) Proof: DP Processor: DPs: f#(x,f(a(),y)) -> f#(a(),x) f#(x,f(a(),y)) -> f#(a(),h(f(a(),x))) f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) TRS: f(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y)) EDG Processor: DPs: f#(x,f(a(),y)) -> f#(a(),x) f#(x,f(a(),y)) -> f#(a(),h(f(a(),x))) f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) TRS: f(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y)) graph: f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) -> f#(x,f(a(),y)) -> f#(a(),x) f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) -> f#(x,f(a(),y)) -> f#(a(),h(f(a(),x))) f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) -> f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) -> f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) -> f#(x,f(a(),y)) -> f#(a(),x) f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) -> f#(x,f(a(),y)) -> f#(a(),h(f(a(),x))) f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) -> f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) -> f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) f#(x,f(a(),y)) -> f#(a(),x) -> f#(x,f(a(),y)) -> f#(a(),x) f#(x,f(a(),y)) -> f#(a(),x) -> f#(x,f(a(),y)) -> f#(a(),h(f(a(),x))) f#(x,f(a(),y)) -> f#(a(),x) -> f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) f#(x,f(a(),y)) -> f#(a(),x) -> f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) SCC Processor: #sccs: 1 #rules: 3 #arcs: 12/16 DPs: f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) f#(x,f(a(),y)) -> f#(a(),x) TRS: f(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y)) Bounds Processor: bound: 1 enrichment: match-dp automaton: final states: {14} transitions: f1(31,37) -> 38* f1(38,22) -> 16* f1(31,31) -> 36* f{#,0}(16,15) -> 14* h1(36) -> 37* f0(16,16) -> 21* f0(16,22) -> 16* f0(16,15) -> 15* a0() -> 16* h0(21) -> 22* f{#,1}(31,16) -> 14* f{#,1}(38,22) -> 14* f{#,1}(31,31) -> 14* a1() -> 31* f40() -> 15* problem: DPs: f#(x,f(a(),y)) -> f#(f(a(),h(f(a(),x))),y) f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) TRS: f(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y)) Subterm Criterion Processor: simple projection: pi(f) = [1,1] pi(f#) = [1,1] problem: DPs: f#(x,f(a(),y)) -> f#(a(),f(f(a(),h(f(a(),x))),y)) TRS: f(x,f(a(),y)) -> f(a(),f(f(a(),h(f(a(),x))),y)) Semantic Labeling Processor: dimension: 2 usable rules:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472