details

property	value
status	complete
benchmark	scnp.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n191.star.cs.uiowa.edu
space	AProVE_10

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	0.37998 seconds
cpu usage	0.53111
user time	0.398259
system time	0.132851
max virtual memory	96176.0
max residence set size	58304.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: f(s(x),y) -> f(x,s(x)) f(x,s(y)) -> f(y,x) f(c(x),y) -> f(x,s(x)) Proof: Matrix Interpretation Processor: dim=1 interpretation: [f](x0, x1) = 4x0 + 2x1, [s](x0) = 4x0 + 6, [c](x0) = 3x0 + 3 orientation: f(s(x),y) = 16x + 2y + 24 >= 12x + 12 = f(x,s(x)) f(x,s(y)) = 4x + 8y + 12 >= 2x + 4y = f(y,x) f(c(x),y) = 12x + 2y + 12 >= 12x + 12 = f(x,s(x)) problem: f(c(x),y) -> f(x,s(x)) Matrix Interpretation Processor: dim=1 interpretation: [f](x0, x1) = 4x0 + 4x1, [s](x0) = x0, [c](x0) = 4x0 + 4 orientation: f(c(x),y) = 16x + 4y + 16 >= 8x = f(x,s(x)) problem: Qed popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to TRS Standard