Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
SRS_Standard 2019-03-29 03.29 pair #432294132
details
property
value
status
complete
benchmark
aprove05.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n061.star.cs.uiowa.edu
space
Secret_06_SRS
run statistics
property
value
solver
ttt2-1.19
configuration
ttt2
runtime (wallclock)
4.13007 seconds
cpu usage
14.9459
user time
13.2564
system time
1.68948
max virtual memory
3940012.0
max residence set size
90644.0
stage attributes
key
value
starexec-result
YES
output
14.71/4.11 YES 14.71/4.12 14.71/4.12 Problem: 14.71/4.12 twoto(0(x1)) -> p(p(s(s(s(p(p(p(s(s(s(0(p(p(s(s(x1)))))))))))))))) 14.71/4.12 twoto(s(x1)) -> 14.71/4.12 p(p(s(s(p(p(p(s(s(s(twice(p(p(s(s(p(p(p(s(s(s(twoto(p(s(p(s(x1)))))))))))))))))))))))))) 14.71/4.12 twice(0(x1)) -> p(s(p(s(0(s(p(s(s(s(s(p(s(x1))))))))))))) 14.71/4.12 twice(s(x1)) -> s(p(p(p(p(s(s(s(s(s(twice(p(s(p(s(p(s(p(s(x1))))))))))))))))))) 14.71/4.12 p(p(s(x1))) -> p(x1) 14.71/4.12 p(s(x1)) -> x1 14.71/4.12 p(0(x1)) -> 0(s(s(s(s(p(s(x1))))))) 14.71/4.12 0(x1) -> x1 14.71/4.12 14.71/4.12 Proof: 14.71/4.12 Matrix Interpretation Processor: dim=1 14.71/4.12 14.71/4.12 interpretation: 14.71/4.12 [twice](x0) = x0, 14.71/4.12 14.71/4.12 [p](x0) = x0, 14.71/4.12 14.71/4.12 [s](x0) = x0, 14.71/4.12 14.71/4.12 [twoto](x0) = 4x0, 14.71/4.12 14.71/4.12 [0](x0) = 4x0 + 2 14.71/4.12 orientation: 14.71/4.12 twoto(0(x1)) = 16x1 + 8 >= 4x1 + 2 = p(p(s(s(s(p(p(p(s(s(s(0(p(p(s(s(x1)))))))))))))))) 14.71/4.12 14.71/4.12 twoto(s(x1)) = 4x1 >= 4x1 = p(p(s(s(p(p(p(s(s(s(twice(p(p(s(s(p(p(p(s(s(s(twoto(p(s(p(s(x1)))))))))))))))))))))))))) 14.71/4.12 14.71/4.12 twice(0(x1)) = 4x1 + 2 >= 4x1 + 2 = p(s(p(s(0(s(p(s(s(s(s(p(s(x1))))))))))))) 14.71/4.12 14.71/4.12 twice(s(x1)) = x1 >= x1 = s(p(p(p(p(s(s(s(s(s(twice(p(s(p(s(p(s(p(s(x1))))))))))))))))))) 14.71/4.12 14.71/4.12 p(p(s(x1))) = x1 >= x1 = p(x1) 14.71/4.12 14.71/4.12 p(s(x1)) = x1 >= x1 = x1 14.71/4.12 14.71/4.12 p(0(x1)) = 4x1 + 2 >= 4x1 + 2 = 0(s(s(s(s(p(s(x1))))))) 14.71/4.12 14.71/4.12 0(x1) = 4x1 + 2 >= x1 = x1 14.71/4.12 problem: 14.71/4.12 twoto(s(x1)) -> 14.71/4.12 p(p(s(s(p(p(p(s(s(s(twice(p(p(s(s(p(p(p(s(s(s(twoto(p(s(p(s(x1)))))))))))))))))))))))))) 14.71/4.12 twice(0(x1)) -> p(s(p(s(0(s(p(s(s(s(s(p(s(x1))))))))))))) 14.71/4.12 twice(s(x1)) -> s(p(p(p(p(s(s(s(s(s(twice(p(s(p(s(p(s(p(s(x1))))))))))))))))))) 14.71/4.12 p(p(s(x1))) -> p(x1) 14.71/4.12 p(s(x1)) -> x1 14.71/4.12 p(0(x1)) -> 0(s(s(s(s(p(s(x1))))))) 14.71/4.12 Bounds Processor: 14.71/4.12 bound: 1 14.71/4.12 enrichment: match 14.71/4.12 automaton: 14.71/4.12 final states: {54,2,53,38,28,1} 14.71/4.12 transitions: 14.71/4.12 p1(55) -> 56* 14.71/4.12 p1(87) -> 88* 14.71/4.12 p1(77) -> 78* 14.71/4.12 p1(79) -> 80* 14.71/4.12 p1(69) -> 70* 14.71/4.12 p1(71) -> 72* 14.71/4.12 p1(61) -> 62* 14.71/4.12 p1(63) -> 64* 14.71/4.12 p1(85) -> 86* 14.71/4.12 f50() -> 2* 14.71/4.12 p0(50) -> 51* 14.71/4.12 p0(35) -> 36* 14.71/4.12 p0(15) -> 16* 14.71/4.12 p0(10) -> 11* 14.71/4.12 p0(5) -> 6* 14.71/4.12 p0(37) -> 28* 14.71/4.12 p0(27) -> 1* 14.71/4.12 p0(22) -> 23* 14.71/4.12 p0(12) -> 13* 14.71/4.12 p0(2) -> 53* 14.71/4.12 p0(49) -> 50* 14.71/4.12 p0(39) -> 40* 14.71/4.12 p0(51) -> 52* 14.71/4.12 p0(41) -> 42* 14.71/4.12 p0(31) -> 32* 14.71/4.12 p0(26) -> 27* 14.71/4.12 p0(21) -> 22* 14.71/4.12 p0(16) -> 17* 14.71/4.12 p0(11) -> 12* 14.71/4.12 p0(48) -> 49* 14.71/4.12 p0(23) -> 24* 14.71/4.12 p0(3) -> 4* 14.71/4.12 s0(45) -> 46* 14.71/4.12 s0(40) -> 41* 14.71/4.12 s0(30) -> 31* 14.71/4.12 s0(25) -> 26* 14.71/4.12 s0(20) -> 21* 14.71/4.12 s0(5) -> 29* 14.71/4.12 s0(52) -> 38* 14.71/4.12 s0(47) -> 48* 14.71/4.12 s0(32) -> 33* 14.71/4.12 s0(7) -> 8* 14.71/4.12 s0(2) -> 3* 14.71/4.12 s0(44) -> 45*
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to SRS_Standard 2019-03-29 03.29