Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
TRS Stand 20472 pair #381710872
details
property
value
status
complete
benchmark
filliatre.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n040.star.cs.uiowa.edu
space
CiME_04
run statistics
property
value
solver
ttt2-1.17+nonreach
configuration
ttt2-1.17+nonreach
runtime (wallclock)
0.944197893143 seconds
cpu usage
2.478997716
max memory
2.16301568E8
stage attributes
key
value
output-size
8796
starexec-result
YES
output
/export/starexec/sandbox2/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem: g(A()) -> A() g(B()) -> A() g(B()) -> B() g(C()) -> A() g(C()) -> B() g(C()) -> C() foldf(x,nil()) -> x foldf(x,cons(y,z)) -> f(foldf(x,z),y) f(t,x) -> f'(t,g(x)) f'(triple(a,b,c),C()) -> triple(a,b,cons(C(),c)) f'(triple(a,b,c),B()) -> f(triple(a,b,c),A()) f'(triple(a,b,c),A()) -> f''(foldf(triple(cons(A(),a),nil(),c),b)) f''(triple(a,b,c)) -> foldf(triple(a,b,nil()),c) Proof: Matrix Interpretation Processor: dim=1 interpretation: [f''](x0) = x0, [triple](x0, x1, x2) = x0 + 3x1 + 2x2, [f'](x0, x1) = x0 + x1 + 2, [f](x0, x1) = x0 + x1 + 2, [cons](x0, x1) = x0 + x1 + 1, [foldf](x0, x1) = x0 + 2x1, [nil] = 0, [C] = 0, [B] = 0, [g](x0) = x0, [A] = 0 orientation: g(A()) = 0 >= 0 = A() g(B()) = 0 >= 0 = A() g(B()) = 0 >= 0 = B() g(C()) = 0 >= 0 = A() g(C()) = 0 >= 0 = B() g(C()) = 0 >= 0 = C() foldf(x,nil()) = x >= x = x foldf(x,cons(y,z)) = x + 2y + 2z + 2 >= x + y + 2z + 2 = f(foldf(x,z),y) f(t,x) = t + x + 2 >= t + x + 2 = f'(t,g(x)) f'(triple(a,b,c),C()) = a + 3b + 2c + 2 >= a + 3b + 2c + 2 = triple(a,b,cons(C(),c)) f'(triple(a,b,c),B()) = a + 3b + 2c + 2 >= a + 3b + 2c + 2 = f(triple(a,b,c),A()) f'(triple(a,b,c),A()) = a + 3b + 2c + 2 >= a + 2b + 2c + 1 = f''(foldf(triple(cons(A(),a),nil(),c),b)) f''(triple(a,b,c)) = a + 3b + 2c >= a + 3b + 2c = foldf(triple(a,b,nil()),c) problem: g(A()) -> A() g(B()) -> A() g(B()) -> B() g(C()) -> A() g(C()) -> B() g(C()) -> C() foldf(x,nil()) -> x foldf(x,cons(y,z)) -> f(foldf(x,z),y) f(t,x) -> f'(t,g(x)) f'(triple(a,b,c),C()) -> triple(a,b,cons(C(),c)) f'(triple(a,b,c),B()) -> f(triple(a,b,c),A()) f''(triple(a,b,c)) -> foldf(triple(a,b,nil()),c) Matrix Interpretation Processor: dim=1 interpretation: [f''](x0) = x0 + 7, [triple](x0, x1, x2) = x0 + x1 + x2 + 1, [f'](x0, x1) = x0 + x1 + 4, [f](x0, x1) = x0 + x1 + 4, [cons](x0, x1) = x0 + x1 + 4,
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to TRS Stand 20472