Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381719347
details
property
value
status
complete
benchmark
size-12-alpha-3-num-536.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n058.star.cs.uiowa.edu
space
Waldmann_07_size12
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
22.7410621643 seconds
cpu usage
89.576375727
max memory
1.46110464E9
stage attributes
key
value
output-size
2963
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: a(a(b(x1))) -> c(b(a(a(a(x1))))) a(c(x1)) -> b(a(x1)) Proof: String Reversal Processor: b(a(a(x1))) -> a(a(a(b(c(x1))))) c(a(x1)) -> a(b(x1)) DP Processor: DPs: b#(a(a(x1))) -> c#(x1) b#(a(a(x1))) -> b#(c(x1)) c#(a(x1)) -> b#(x1) TRS: b(a(a(x1))) -> a(a(a(b(c(x1))))) c(a(x1)) -> a(b(x1)) TDG Processor: DPs: b#(a(a(x1))) -> c#(x1) b#(a(a(x1))) -> b#(c(x1)) c#(a(x1)) -> b#(x1) TRS: b(a(a(x1))) -> a(a(a(b(c(x1))))) c(a(x1)) -> a(b(x1)) graph: c#(a(x1)) -> b#(x1) -> b#(a(a(x1))) -> b#(c(x1)) c#(a(x1)) -> b#(x1) -> b#(a(a(x1))) -> c#(x1) b#(a(a(x1))) -> c#(x1) -> c#(a(x1)) -> b#(x1) b#(a(a(x1))) -> b#(c(x1)) -> b#(a(a(x1))) -> b#(c(x1)) b#(a(a(x1))) -> b#(c(x1)) -> b#(a(a(x1))) -> c#(x1) Matrix Interpretation Processor: dim=4 interpretation: [c#](x0) = [0 0 0 1]x0 + [1], [b#](x0) = [0 1 0 0]x0, [0 0 0 0] [0] [0 0 0 1] [0] [c](x0) = [0 0 0 1]x0 + [1] [0 0 0 1] [0], [0 0 0 0] [0] [0 0 1 0] [0] [a](x0) = [0 0 0 1]x0 + [1] [0 1 0 0] [0], [0 0 1 0] [0 1 0 0] [b](x0) = [0 1 0 0]x0 [0 1 0 0] orientation: b#(a(a(x1))) = [0 0 0 1]x1 + [1] >= [0 0 0 1]x1 + [1] = c#(x1) b#(a(a(x1))) = [0 0 0 1]x1 + [1] >= [0 0 0 1]x1 = b#(c(x1)) c#(a(x1)) = [0 1 0 0]x1 + [1] >= [0 1 0 0]x1 = b#(x1) [0 1 0 0] [1] [0 0 0 0] [0] [0 0 0 1] [1] [0 0 0 1] [1] b(a(a(x1))) = [0 0 0 1]x1 + [1] >= [0 0 0 1]x1 + [1] = a(a(a(b(c(x1))))) [0 0 0 1] [1] [0 0 0 1] [1] [0 0 0 0] [0] [0 0 0 0] [0] [0 1 0 0] [0] [0 1 0 0] [0] c(a(x1)) = [0 1 0 0]x1 + [1] >= [0 1 0 0]x1 + [1] = a(b(x1)) [0 1 0 0] [0] [0 1 0 0] [0] problem: DPs: b#(a(a(x1))) -> c#(x1) TRS: b(a(a(x1))) -> a(a(a(b(c(x1))))) c(a(x1)) -> a(b(x1)) Restore Modifier: DPs: b#(a(a(x1))) -> c#(x1) TRS: b(a(a(x1))) -> a(a(a(b(c(x1))))) c(a(x1)) -> a(b(x1)) EDG Processor: DPs: b#(a(a(x1))) -> c#(x1) TRS: b(a(a(x1))) -> a(a(a(b(c(x1))))) c(a(x1)) -> a(b(x1)) graph: SCC Processor: #sccs: 0 #rules: 0 #arcs: 0/1
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685