Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS Stand 10685 pair #381719228
details
property
value
status
complete
benchmark
z125.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n079.star.cs.uiowa.edu
space
Zantema_04
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
2.82348608971 seconds
cpu usage
9.795571045
max memory
7.25516288E8
stage attributes
key
value
output-size
4805
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(x1) -> n(c(n(a(x1)))) c(f(x1)) -> f(n(a(c(x1)))) n(a(x1)) -> c(x1) c(c(x1)) -> c(x1) n(s(x1)) -> f(s(s(x1))) n(f(x1)) -> f(n(x1)) Proof: String Reversal Processor: f(x1) -> a(n(c(n(x1)))) f(c(x1)) -> c(a(n(f(x1)))) a(n(x1)) -> c(x1) c(c(x1)) -> c(x1) s(n(x1)) -> s(s(f(x1))) f(n(x1)) -> n(f(x1)) Matrix Interpretation Processor: dim=3 interpretation: [1 1 0] [s](x0) = [0 0 0]x0 [1 1 0] , [1 0 0] [c](x0) = [0 0 0]x0 [0 0 0] , [1 0 0] [0] [n](x0) = [0 1 0]x0 + [1] [0 0 0] [0], [1 0 0] [0] [a](x0) = [0 0 0]x0 + [0] [0 0 0] [1], [1 0 0] [0] [f](x0) = [0 1 0]x0 + [0] [0 0 0] [1] orientation: [1 0 0] [0] [1 0 0] [0] f(x1) = [0 1 0]x1 + [0] >= [0 0 0]x1 + [0] = a(n(c(n(x1)))) [0 0 0] [1] [0 0 0] [1] [1 0 0] [0] [1 0 0] f(c(x1)) = [0 0 0]x1 + [0] >= [0 0 0]x1 = c(a(n(f(x1)))) [0 0 0] [1] [0 0 0] [1 0 0] [0] [1 0 0] a(n(x1)) = [0 0 0]x1 + [0] >= [0 0 0]x1 = c(x1) [0 0 0] [1] [0 0 0] [1 0 0] [1 0 0] c(c(x1)) = [0 0 0]x1 >= [0 0 0]x1 = c(x1) [0 0 0] [0 0 0] [1 1 0] [1] [1 1 0] s(n(x1)) = [0 0 0]x1 + [0] >= [0 0 0]x1 = s(s(f(x1))) [1 1 0] [1] [1 1 0] [1 0 0] [0] [1 0 0] [0] f(n(x1)) = [0 1 0]x1 + [1] >= [0 1 0]x1 + [1] = n(f(x1)) [0 0 0] [1] [0 0 0] [0] problem: f(x1) -> a(n(c(n(x1)))) f(c(x1)) -> c(a(n(f(x1)))) a(n(x1)) -> c(x1) c(c(x1)) -> c(x1) f(n(x1)) -> n(f(x1)) String Reversal Processor: f(x1) -> n(c(n(a(x1)))) c(f(x1)) -> f(n(a(c(x1)))) n(a(x1)) -> c(x1) c(c(x1)) -> c(x1) n(f(x1)) -> f(n(x1)) Matrix Interpretation Processor: dim=1 interpretation: [c](x0) = x0, [n](x0) = x0, [a](x0) = x0, [f](x0) = 4x0 + 1 orientation: f(x1) = 4x1 + 1 >= x1 = n(c(n(a(x1)))) c(f(x1)) = 4x1 + 1 >= 4x1 + 1 = f(n(a(c(x1)))) n(a(x1)) = x1 >= x1 = c(x1) c(c(x1)) = x1 >= x1 = c(x1)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS Stand 10685