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