details

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

run statistics

property	value
solver	ttt2-1.17+nonreach
configuration	ttt2-1.17+nonreach
runtime (wallclock)	3.77287602425 seconds
cpu usage	13.54802115
max memory	8.6945792E8

stage attributes

key	value
output-size	1331
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: s(s(0())) -> f(0()) f(0()) -> 0() s(s(s(0()))) -> f(s(0())) f(s(0())) -> s(0()) s(s(s(s(s(s(s(s(0())))))))) -> f(s(s(0()))) f(s(s(0()))) -> s(s(s(s(s(s(0())))))) g(x) -> h(x,x) s(x) -> h(x,0()) s(x) -> h(0(),x) f(g(x)) -> g(g(f(x))) g(s(x)) -> s(s(g(x))) h(f(x),g(x)) -> f(s(x)) Proof: Polynomial Interpretation Processor: dimension: 1 interpretation: [h](x0, x1) = x0 + x1, [g](x0) = 4x0 + 5, [f](x0) = -1x0 + 2x0x0 + 1, [s](x0) = x0 + 1, [0] = 0 orientation: s(s(0())) = 2 >= 1 = f(0()) f(0()) = 1 >= 0 = 0() s(s(s(0()))) = 3 >= 2 = f(s(0())) f(s(0())) = 2 >= 1 = s(0()) s(s(s(s(s(s(s(s(0())))))))) = 8 >= 7 = f(s(s(0()))) f(s(s(0()))) = 7 >= 6 = s(s(s(s(s(s(0())))))) g(x) = 4x + 5 >= 2x = h(x,x) s(x) = x + 1 >= x = h(x,0()) s(x) = x + 1 >= x = h(0(),x) f(g(x)) = 76x + 32x*x + 46 >= -16x + 32x*x + 41 = g(g(f(x))) g(s(x)) = 4x + 9 >= 4x + 7 = s(s(g(x))) h(f(x),g(x)) = 3x + 2x*x + 6 >= 3x + 2x*x + 2 = f(s(x)) problem: Qed popout

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

job log

popout

actions

all output return to TRS Stand 20472