details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	8.62669610977 seconds
cpu usage	33.028556355
max memory	1.479258112E9

stage attributes

key	value
output-size	1343
starexec-result	YES

output

/export/starexec/sandbox/solver/bin/starexec_run_ttt2 /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: 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)) s(0()) -> f(0()) s(s(0())) -> f(s(0())) f(s(0())) -> 0() s(s(s(s(s(s(s(0()))))))) -> f(s(s(0()))) f(s(s(0()))) -> s(s(s(s(s(0()))))) f(s(s(x))) -> h(f(x),g(h(x,x))) Proof: Polynomial Interpretation Processor: dimension: 1 interpretation: [f](x0) = -1x0 + 2x0x0, [h](x0, x1) = x0 + x1, [0] = 0, [g](x0) = 4x0 + 4, [s](x0) = x0 + 1 orientation: g(x) = 4x + 4 >= 2x = h(x,x) s(x) = x + 1 >= x = h(x,0()) s(x) = x + 1 >= x = h(0(),x) f(g(x)) = 60x + 32x*x + 28 >= -16x + 32x*x + 20 = g(g(f(x))) g(s(x)) = 4x + 8 >= 4x + 6 = s(s(g(x))) h(f(x),g(x)) = 3x + 2x*x + 4 >= 3x + 2x*x + 1 = f(s(x)) s(0()) = 1 >= 0 = f(0()) s(s(0())) = 2 >= 1 = f(s(0())) f(s(0())) = 1 >= 0 = 0() s(s(s(s(s(s(s(0()))))))) = 7 >= 6 = f(s(s(0()))) f(s(s(0()))) = 6 >= 5 = s(s(s(s(s(0()))))) f(s(s(x))) = 7x + 2x*x + 6 >= 7x + 2x*x + 4 = h(f(x),g(h(x,x))) problem: Qed popout

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

job log

popout

actions

all output return to TRS Standard