Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Standard pair #487084790
details
property
value
status
complete
benchmark
size-12-alpha-3-num-126.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n149.star.cs.uiowa.edu
space
Waldmann_07_size12
run statistics
property
value
solver
ttt2-1.20
configuration
ttt2
runtime (wallclock)
43.6115 seconds
cpu usage
192.604
user time
189.366
system time
3.23807
max virtual memory
1.173102E7
max residence set size
101872.0
stage attributes
key
value
starexec-result
YES
output
YES Problem: a(x1) -> x1 a(a(b(x1))) -> c(c(b(a(x1)))) b(c(x1)) -> a(b(x1)) Proof: String Reversal Processor: a(x1) -> x1 b(a(a(x1))) -> a(b(c(c(x1)))) c(b(x1)) -> b(a(x1)) DP Processor: DPs: b#(a(a(x1))) -> c#(x1) b#(a(a(x1))) -> c#(c(x1)) b#(a(a(x1))) -> b#(c(c(x1))) b#(a(a(x1))) -> a#(b(c(c(x1)))) c#(b(x1)) -> a#(x1) c#(b(x1)) -> b#(a(x1)) TRS: a(x1) -> x1 b(a(a(x1))) -> a(b(c(c(x1)))) c(b(x1)) -> b(a(x1)) TDG Processor: DPs: b#(a(a(x1))) -> c#(x1) b#(a(a(x1))) -> c#(c(x1)) b#(a(a(x1))) -> b#(c(c(x1))) b#(a(a(x1))) -> a#(b(c(c(x1)))) c#(b(x1)) -> a#(x1) c#(b(x1)) -> b#(a(x1)) TRS: a(x1) -> x1 b(a(a(x1))) -> a(b(c(c(x1)))) c(b(x1)) -> b(a(x1)) graph: c#(b(x1)) -> b#(a(x1)) -> b#(a(a(x1))) -> a#(b(c(c(x1)))) c#(b(x1)) -> b#(a(x1)) -> b#(a(a(x1))) -> b#(c(c(x1))) c#(b(x1)) -> b#(a(x1)) -> b#(a(a(x1))) -> c#(c(x1)) c#(b(x1)) -> b#(a(x1)) -> b#(a(a(x1))) -> c#(x1) b#(a(a(x1))) -> c#(c(x1)) -> c#(b(x1)) -> b#(a(x1)) b#(a(a(x1))) -> c#(c(x1)) -> c#(b(x1)) -> a#(x1) b#(a(a(x1))) -> c#(x1) -> c#(b(x1)) -> b#(a(x1)) b#(a(a(x1))) -> c#(x1) -> c#(b(x1)) -> a#(x1) b#(a(a(x1))) -> b#(c(c(x1))) -> b#(a(a(x1))) -> a#(b(c(c(x1)))) b#(a(a(x1))) -> b#(c(c(x1))) -> b#(a(a(x1))) -> b#(c(c(x1))) b#(a(a(x1))) -> b#(c(c(x1))) -> b#(a(a(x1))) -> c#(c(x1)) b#(a(a(x1))) -> b#(c(c(x1))) -> b#(a(a(x1))) -> c#(x1) SCC Processor: #sccs: 1 #rules: 4 #arcs: 12/36 DPs: c#(b(x1)) -> b#(a(x1)) b#(a(a(x1))) -> c#(x1) b#(a(a(x1))) -> c#(c(x1)) b#(a(a(x1))) -> b#(c(c(x1))) TRS: a(x1) -> x1 b(a(a(x1))) -> a(b(c(c(x1)))) c(b(x1)) -> b(a(x1)) KBO Processor: argument filtering: pi(a) = 0 pi(b) = [0] pi(c) = 0 pi(b#) = 0 pi(c#) = 0 usable rules: a(x1) -> x1 b(a(a(x1))) -> a(b(c(c(x1)))) c(b(x1)) -> b(a(x1)) weight function: w0 = 1 w(b) = 1 w(c#) = w(b#) = w(c) = w(a) = 0 precedence: b > a > c > c# > b# problem: DPs: b#(a(a(x1))) -> c#(x1) b#(a(a(x1))) -> c#(c(x1)) b#(a(a(x1))) -> b#(c(c(x1))) TRS: a(x1) -> x1 b(a(a(x1))) -> a(b(c(c(x1)))) c(b(x1)) -> b(a(x1)) Restore Modifier: DPs: b#(a(a(x1))) -> c#(x1) b#(a(a(x1))) -> c#(c(x1)) b#(a(a(x1))) -> b#(c(c(x1))) TRS: a(x1) -> x1 b(a(a(x1))) -> a(b(c(c(x1)))) c(b(x1)) -> b(a(x1)) EDG Processor: DPs: b#(a(a(x1))) -> c#(x1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Standard