details

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

run statistics

property	value
solver	ttt2-1.20
configuration	ttt2
runtime (wallclock)	6.61215 seconds
cpu usage	24.83
user time	22.7941
system time	2.03591
max virtual memory	5999708.0
max residence set size	86280.0

stage attributes

key	value
starexec-result	YES

output

YES Problem: p(0(x1)) -> s(s(0(s(s(p(x1)))))) p(s(0(x1))) -> 0(x1) p(s(s(x1))) -> s(p(s(x1))) f(s(x1)) -> g(q(i(x1))) g(x1) -> f(p(p(x1))) q(i(x1)) -> q(s(x1)) q(s(x1)) -> s(s(x1)) i(x1) -> s(x1) Proof: Matrix Interpretation Processor: dim=4 interpretation: [1 0 0 0] [0 1 1 0] [i](x0) = [0 0 0 0]x0 [1 0 0 0] , [1 0 0 1] [0] [1 0 0 0] [1] [p](x0) = [1 0 0 0]x0 + [1] [0 1 0 0] [0], [1 0 0 0] [0] [0 0 0 0] [0] [f](x0) = [0 0 0 0]x0 + [1] [1 0 0 0] [0], [1 0 0 0] [0 0 0 0] [q](x0) = [0 0 0 1]x0 [0 0 0 0] , [1 0 0 1] [0] [0 0 0 0] [0] [0](x0) = [0 0 0 0]x0 + [1] [0 0 0 0] [1], [1 1 0 1] [0] [0 0 0 0] [0] [g](x0) = [0 0 0 1]x0 + [1] [1 1 0 1] [0], [1 0 0 0] [0 0 1 0] [s](x0) = [0 0 0 0]x0 [0 0 0 0] orientation: [1 0 0 1] [1] [1 0 0 1] [1 0 0 1] [1] [0 0 0 0] p(0(x1)) = [1 0 0 1]x1 + [1] >= [0 0 0 0]x1 = s(s(0(s(s(p(x1)))))) [0 0 0 0] [0] [0 0 0 0] [1 0 0 1] [0] [1 0 0 1] [0] [1 0 0 1] [1] [0 0 0 0] [0] p(s(0(x1))) = [1 0 0 1]x1 + [1] >= [0 0 0 0]x1 + [1] = 0(x1) [0 0 0 0] [1] [0 0 0 0] [1] [1 0 0 0] [0] [1 0 0 0] [0] [1 0 0 0] [1] [1 0 0 0] [1] p(s(s(x1))) = [1 0 0 0]x1 + [1] >= [0 0 0 0]x1 + [0] = s(p(s(x1))) [0 0 0 0] [0] [0 0 0 0] [0] [1 0 0 0] [0] [1 0 0 0] [0] [0 0 0 0] [0] [0 0 0 0] [0] f(s(x1)) = [0 0 0 0]x1 + [1] >= [0 0 0 0]x1 + [1] = g(q(i(x1))) [1 0 0 0] [0] [1 0 0 0] [0] [1 1 0 1] [0] [1 1 0 1] [0] [0 0 0 0] [0] [0 0 0 0] [0] g(x1) = [0 0 0 1]x1 + [1] >= [0 0 0 0]x1 + [1] = f(p(p(x1))) [1 1 0 1] [0] [1 1 0 1] [0] [1 0 0 0] [1 0 0 0] [0 0 0 0] [0 0 0 0] q(i(x1)) = [1 0 0 0]x1 >= [0 0 0 0]x1 = q(s(x1)) [0 0 0 0] [0 0 0 0] [1 0 0 0] [1 0 0 0] [0 0 0 0] [0 0 0 0] q(s(x1)) = [0 0 0 0]x1 >= [0 0 0 0]x1 = s(s(x1)) [0 0 0 0] [0 0 0 0] [1 0 0 0] [1 0 0 0] [0 1 1 0] [0 0 1 0] i(x1) = [0 0 0 0]x1 >= [0 0 0 0]x1 = s(x1) [1 0 0 0] [0 0 0 0] problem: p(s(0(x1))) -> 0(x1) p(s(s(x1))) -> s(p(s(x1))) f(s(x1)) -> g(q(i(x1))) g(x1) -> f(p(p(x1))) q(i(x1)) -> q(s(x1)) q(s(x1)) -> s(s(x1)) i(x1) -> s(x1) Matrix Interpretation Processor: dim=4 popout

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

job log

popout

actions

all output return to SRS Standard