Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381714342
details
property
value
status
complete
benchmark
jw19.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n010.star.cs.uiowa.edu
space
Zantema_05
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
0.896080970764 seconds
cpu usage
2.164561827
max memory
2.38641152E8
stage attributes
key
value
output-size
2501
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(x,f(a(),a())) -> f(f(f(a(),a()),a()),f(a(),x)) Proof: DP Processor: DPs: f#(x,f(a(),a())) -> f#(a(),x) f#(x,f(a(),a())) -> f#(f(a(),a()),a()) f#(x,f(a(),a())) -> f#(f(f(a(),a()),a()),f(a(),x)) TRS: f(x,f(a(),a())) -> f(f(f(a(),a()),a()),f(a(),x)) EDG Processor: DPs: f#(x,f(a(),a())) -> f#(a(),x) f#(x,f(a(),a())) -> f#(f(a(),a()),a()) f#(x,f(a(),a())) -> f#(f(f(a(),a()),a()),f(a(),x)) TRS: f(x,f(a(),a())) -> f(f(f(a(),a()),a()),f(a(),x)) graph: f#(x,f(a(),a())) -> f#(f(f(a(),a()),a()),f(a(),x)) -> f#(x,f(a(),a())) -> f#(a(),x) f#(x,f(a(),a())) -> f#(f(f(a(),a()),a()),f(a(),x)) -> f#(x,f(a(),a())) -> f#(f(a(),a()),a()) f#(x,f(a(),a())) -> f#(f(f(a(),a()),a()),f(a(),x)) -> f#(x,f(a(),a())) -> f#(f(f(a(),a()),a()),f(a(),x)) f#(x,f(a(),a())) -> f#(a(),x) -> f#(x,f(a(),a())) -> f#(a(),x) f#(x,f(a(),a())) -> f#(a(),x) -> f#(x,f(a(),a())) -> f#(f(a(),a()),a()) f#(x,f(a(),a())) -> f#(a(),x) -> f#(x,f(a(),a())) -> f#(f(f(a(),a()),a()),f(a(),x)) SCC Processor: #sccs: 1 #rules: 2 #arcs: 6/9 DPs: f#(x,f(a(),a())) -> f#(f(f(a(),a()),a()),f(a(),x)) f#(x,f(a(),a())) -> f#(a(),x) TRS: f(x,f(a(),a())) -> f(f(f(a(),a()),a()),f(a(),x)) Bounds Processor: bound: 1 enrichment: match-dp automaton: final states: {7} transitions: f0(10,9) -> 9* f0(9,9) -> 10,8 a0() -> 9* f{#,1}(11,9) -> 7* a1() -> 11* f30() -> 8* f{#,0}(9,8) -> 7* problem: DPs: f#(x,f(a(),a())) -> f#(f(f(a(),a()),a()),f(a(),x)) TRS: f(x,f(a(),a())) -> f(f(f(a(),a()),a()),f(a(),x)) Bounds Processor: bound: 1 enrichment: match automaton: final states: {7,1} transitions: a1() -> 8* f100() -> 2* f1(8,6) -> 9* f1(8,8) -> 10* f1(10,8) -> 11* f1(11,9) -> 4* f{#,0}(6,4) -> 1* f0(3,3) -> 5* f0(5,3) -> 6* f0(6,4) -> 4,7 f0(3,2) -> 4* f0(3,6) -> 4* f0(6,5) -> 4* a0() -> 3* problem: DPs: TRS: f(x,f(a(),a())) -> f(f(f(a(),a()),a()),f(a(),x)) Qed
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472