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